Booth's multiplication algorithm: Difference between revisions

Revision as of 15:22, 4 May 2005

Revision as of 20:28, 15 June 2005

Line 30:

# Add a 0 to the right of the binary number that results from the previous step: 0000 1100 0

# Rightmost bit check loop:

## 0000 1100110'''0 0''' (check performed)

## 0000 1100110'''0 0''' (did nothing)

## 0000 0110011'''0 0''' (ashift-right performed)

## 0000 0110011'''0 0''' (check performed)

## 0000 0110011'''0 0''' (did nothing)

## 0000 0011001'''1 0''' (ashift-right performed)

## 0000 0011001'''1 0''' (check performed)

## 1101 0011001'''1 0''' (subtract performed)

## 1110 1001100'''1 1''' (ashift-right performed)

## 1110 1001100'''1 1''' (check performed)

## 1110 1001100'''1 1''' (did nothing)

## 1111 0100010'''0 1''' (ashift-right performed)

# Remove the rightmost bit from the resultant binary number: 1111 0100