Revision as of 01:57, 9 October 2005 edit 12.217.44.136 (talk) →Example ← Previous edit		Revision as of 01:59, 9 October 2005 edit undo 12.217.44.136 (talk) →Procedure Next edit →
Line 4: * Convert the factors to [[two's complement]] notation. * Find the negative of the multiplicand. * Count how many bits are in the multiplicand. Add that many 0s to the left of the multiplier, to make room for the additions below. * Add a 0 to the right of the multiplier. Line 10: # If the two rightmost bits are... #* 00 or 11: do nothing. # 01: add the multiplicand to the ~~left~~far ~~half~~left of the multiplier. Ignore any overflow. # 10: add the negative of the multiplicand to the ~~left~~far ~~half~~left of the multiplier. Ignore any overflow. *# Perform a right [[arithmetic shift]] on the result.

Booth's multiplication algorithm: Difference between revisions