Booth's Algorithm

This is an algorithm that simplifies multiplication.

Algorithm

1. Sign Extend to make both bytes the same length
2. For binary byte with length $n$
3. Go through digits from $n-1$ to $0$
   1. If digits at $i$ and $i-1$ are $0,1$, then the multiplicand is added to the result at position $i$
   2. If digits $i$ and $i-1$ are $1,0$, then the multiplicand is subtracted from the result at position $i$

Example in Decimal

Involves segmenting multiplication into easier sub-multiplications with better numbers.