Question

Booth's multiplication algorithm with example -7×-13
​
​

Answer 1

Answer:

Basically, Booth's algorithm uses the concept of an arithmetic right shift in which the leftmost bit is not only shifted right by 1 bit but it also remains in the original position

It is a simple method to multiply binary numbers in which multiplication is performed with repeated addition operations by following the booth algorithm. ... Again this booth algorithm for multiplication operation is further modified and hence, named as modified booth algorithm.

Booth's algorithm is a multiplication algorithm that multiplies two signed binary numbers in 2's compliment notation. Booth used desk calculators that were faster at shifting than adding and created the algorithm to increase their speed. Booth's algorithm is of interest in the study of computer architecture

Booth's algorithm works because 99 * N = 100 * N - N, but the latter is easier to calculate (thus using fewer brain resources).