Booth's multiplication algorithm: Difference between revisions

Revision as of 05:29, 18 March 2005

Revision as of 23:06, 29 March 2005

Line 14:

## If they're 00 or 11 do nothing.

## If they're 01, add the multiplicand to the left half of the binary number. Ignore any carry or overflow.

## If they're 10, substractsubtract the multiplicand to the left half of the binary number. Ignore any carry or overflow.*

# Perform an [[arithmetic shift]] to the right on the resultant binary number.

# Repeat step 5 and 6 as many times as there are bits in the multiplicator.

# Remove the rightmost bit from the resultant binary number.

<small><nowiki>*</nowiki> Note that we are substractingsubtracting two's complements, in other words: add -(multiplicand).</small>

==Example==

Line 37:

## 0000 0011 0 (ashift-right performed)

## 0000 0011 0 (check performed)

## 1101 0011 0 (substractsubtract performed)

## 1110 1001 1 (ashift-right performed)

## 1110 1001 1 (check performed)