Booth's multiplication algorithm: Difference between revisions

Revision as of 02:14, 9 October 2005

Revision as of 02:16, 9 October 2005

Line 3:

==Procedure==

* For later reference, write the multiplicand and its negative in [[two's complement]] notation.

* Write the product, which starts out as the multiplier in two's complement notation.

* Write the starting product :

** Count how many bits are in the multiplicand. Write that many 0s to the left of the product, to make room for the additions below.

* Write a 0 to the right of the product.

** To the right of the zeroes, write the multiplier.

** To the right of the multiplier, write a 0.

* Count how many bits are in the product. That many times, do this :