Revision as of 03:50, 9 October 2005 edit 12.217.44.136 (talk) →Procedure ← Previous edit		Revision as of 03:53, 9 October 2005 edit undo 12.217.44.136 (talk) →Procedure Next edit →
Line 20: # 01: P = P + A. Ignore any overflow. # 10: P = P + S. Ignore any overflow. # ~~Perform a right~~ [[~~arithmetic~~Arithmetically shift\|Arithmetic shift]] on the product right one position. <br /> Drop the rightmost bit from the product for the final result.

Booth's multiplication algorithm: Difference between revisions