Booth's multiplication algorithm: Difference between revisions

Revision as of 02:07, 9 October 2005

Revision as of 02:08, 9 October 2005

Line 21:

* The multiplicand, 3, is 0011; its negative is 1101.

* The multiplier,product starts as -4, which is 1100; with all zeroes added, it is 000011000.

* Perform the loop four times :

Line 34:

** 1111 01001. A right shift.

* The resultproduct is 111101001111 0100, which is -12.

==Why does Booth's algorithm work ?==