Booth's multiplication algorithm: Difference between revisions

Revision as of 01:52, 9 October 2005

Revision as of 01:57, 9 October 2005

Line 23:

* Perform the loop four times :

** 00001100000 110'''00'''. The last two bits are 00.

** 0000011000000 01100. A right shift.

** 00000110000 011'''00'''. The last two bits are 00.

** 0000001100000 00110. A right shift.

** 00000010000 001'''10'''. The last two bits are 10.

** 1101001101101 00110. Add the negative of the multiplicand.

** 1110100111110 10011. A right shift.

** 11101001110 100'''11'''. The last two bits are 11.

** 1111010011111 01001. A right shift.

* The result is 11110100, which is -12.