Booth's multiplication algorithm: Difference between revisions

Revision as of 03:49, 9 October 2005

Revision as of 03:50, 9 October 2005

Line 4:

If ''x'' is the number of bits of the multiplicand, and ''y'' is the number of bits of the multiplier :

* Draw a grid of three lines, each with squares for ''x'' + ''y'' + 1 bits. Label themthe lines respectively A (add), S (subtract), and P (product).

* In [[two's complement notation]], fill the first ''x'' bits of each line with :

** A: the multiplicand