Revision as of 02:46, 9 October 2005 edit 12.217.44.136 (talk) →Procedure ← Previous edit		Revision as of 02:47, 9 October 2005 edit undo 12.217.44.136 (talk) →Procedure Next edit →
Line 9: * 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. # 01: add the multiplicand to the far left of the product. Ignore any overflow. # 10: add the negative of the multiplicand to the far left of the product. Ignore any overflow. # Perform a right [[arithmetic shift]] on the ~~result~~product. Remove the rightmost bit from the product.

Booth's multiplication algorithm: Difference between revisions