Revision as of 02:16, 9 October 2005 edit 12.217.44.136 (talk) →Procedure ← Previous edit		Revision as of 02:19, 9 October 2005 edit undo 12.217.44.136 (talk) →Procedure Next edit →
Line 8: ** To the right of the multiplier, write a 0. * Count how many bits are in the product. That many times, do ~~this~~these two steps : # If the two rightmost bits are... #* 00 or 11: do nothing.

Booth's multiplication algorithm: Difference between revisions