Scribd
Upload
9 views1 page

Booth's Algorithm for Binary Multiplication

This document explains Booth's algorithm for binary multiplication through a step-by-step example of multiplying 2 by 3. It details the binary representation of the numbers, the iterative process of the algorithm, and concludes with the final result in both binary and decimal forms. The final result of the multiplication is 0110 in binary, which equals 6 in decimal.

Uploaded by

pspaya0000
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views1 page

Booth's Algorithm for Binary Multiplication

This document explains Booth's algorithm for binary multiplication through a step-by-step example of multiplying 2 by 3. It details the binary representation of the numbers, the iterative process of the algorithm, and concludes with the final result in both binary and decimal forms. The final result of the multiplication is 0110 in binary, which equals 6 in decimal.

Uploaded by

pspaya0000
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Booth's Algorithm Multiplication Example

This document demonstrates the step-by-step process of Booth's algorithm for binary multiplication.
We will multiply 2 × 3 using Booth's algorithm.

Step 1: Represent numbers in binary


2 in binary (4-bit) = 0010
3 in binary (4-bit) = 0011
Multiplicand (M) = 0010
Multiplier (Q) = 0011
Q-1 = 0
Accumulator (A) = 0000

Step 2: Perform Booth's Algorithm Iterations We will perform as many steps as the number of
bits in the multiplier (4 iterations).

Iteration A (Accumulator) Q (Multiplier) Q-1 Operation

1 0000 0011 0 Q0=1 & Q-1=0 → A = A - M → A = 0000 - 0010 = 11


Shift 1110 0001 1 Arithmetic right shift
2 1110 0001 1 Q0=1 & Q-1=1 → No operation
Shift 1111 1000 1 Arithmetic right shift
3 1111 1000 1 Q0=0 & Q-1=1 → A = A + M → A = 1111 + 0010 = 00
Shift 0000 1100 0 Arithmetic right shift
4 0000 1100 0 Q0=0 & Q-1=0 → No operation
Shift 0000 0110 0 Final result after shift

Step 3: Final Result


The result is contained in A and Q registers combined.
Final binary result = 0110
Decimal result = 6

You might also like