Booth's multiplication algorithm: Difference between revisions

Revision as of 02:10, 9 October 2005

Revision as of 02:10, 9 October 2005

Line 2:

==Procedure==

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

* The product starts out as the multiplier in two's complement notation.

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