Booth's multiplication algorithm: Difference between revisions

Revision as of 03:48, 9 October 2005

Revision as of 03:49, 9 October 2005

Line 15:

* Fill the final bit of each line with zeroes.

<br />

* Do both of these steps ''y'' times :

* Count how many bits are in the multiplier. That many times, do these two steps :

*# If the two rightmost bits in the product are...

*#* 00 or 11: do nothing.