Booth's multiplication algorithm: Difference between revisions

Revision as of 01:03, 9 October 2005

Revision as of 01:15, 9 October 2005

Line 2:

==Procedure==

# Convert the [[multiplicator]]factors to a binary number in [[two's complement]] notation.

# Convert the [[multiplicand]] to a binary number in [[two's complement]] notation.

# Add 0s to the left of the multiplicator in a quantity equivalent to the number of bits in the multiplicand.

# Add a 0 to the right of the binary number that results from the previous step.