Booth's multiplication algorithm: Difference between revisions

Revision as of 01:42, 9 October 2005

Revision as of 01:43, 9 October 2005

Line 2:

==Procedure==

* Convert the factors to [[two's complement]] notation.
* Find the negative of the multiplicand.

* Count how many bits are in the multiplicand. Add that many 0s to the left of the multiplier.

* Add a 0 to the right of the multiplier.