Booth's multiplication algorithm: Difference between revisions

Revision as of 02:08, 9 October 2005

Revision as of 02:10, 9 October 2005

Line 2:

==Procedure==

* ConvertFor reference, write the factorsmultiplicand and its negative toin [[two's complement]] notation.

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

* Find the negative of the multiplicand.

* The product starts out as the multiplier.

* 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.

* Add a 0 to the right of the product.