Scribd
Upload
45 views

Datapath Design - 2

The document discusses various algorithms for multiplication of binary numbers in computers. It introduces the general concept of multiplication where the size of the product depends on the sizes of the multiplicand and multiplier. It then describes the sequential algorithm and considerations for hardware implementation. Finally, it covers Booth's multiplication algorithm which can provide faster execution by considering two bits of the multiplier at a time and using both addition and subtraction to compute the product.

Uploaded by

Md. Atikur Rahman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
45 views

Datapath Design - 2

The document discusses various algorithms for multiplication of binary numbers in computers. It introduces the general concept of multiplication where the size of the product depends on the sizes of the multiplicand and multiplier. It then describes the sequential algorithm and considerations for hardware implementation. Finally, it covers Booth's multiplication algorithm which can provide faster execution by considering two bits of the multiplier at a time and using both addition and subtraction to compute the product.

Uploaded by

Md. Atikur Rahman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Arithmetic for Computers

Chapter Three
Book of David A. Patteron
P. Hayes
page-239-240
General Concept of Multiplication
10002 × 10012
✔ If multiplicand = n bits and
multiplier = m bits then product
Multiplicand = n + m bits.
Multiplier ✔ Two rules:
1. Place a copy of multiplicand in
the proper place if multiplier
bit=1.
2. Place 0 in the proper place if
multiplier bit = 0.
✔ Like addition, overflow can
occur.
Product
Sequential Version of the Multiplication
Algorithm and Hardware (Unsigned Number)

✔ A moderate frequency for a slow


operation can limit performance.
Example

Works for negative number. Consider sign extension during shift operation.
Refined Version of Multiplication
Algorithm
• Execution time can be reduced through parallelism.
• Hardware cost can be reduced by using non-utilized portion of
product register.
Example
Booth’s Multiplication
✔ Used for both positive and negative number (2’s complement
number).
✔ It uses both add and sub to compute the product.
✔ Instead of 1 bit of a multiplier it considers 2 bits.
✔ It provides faster execution.
Concepts of Booth’s Algorithm
210× 610 = 1210
✔ 610 = -210 + 810
» 610 × 210 = - 210× 210 + 810 × 210
» 1210 = -410+1610
✔ Condition:
1. subtract when first see a 1. (10).
2. add when see the bit after the last
1. (01)
Validity of Booth’s Algorithm

• In normal multiplication the contribution of X* to P = X × Y is

• In booth’s multiplication, xixi-1 =01 which contributes 2iY.


• When xi-kxi-k-1 = 10 the contribution is -2i-kY.
• Net Contribution:

• If j=m+i-k then we get


Booth’s Algorithm
✔ Step 1:
Depending on the current and previous bit, do one of the
following:
00: No arithmetic operation.
01:Add multiplicand to the left half of the product.
10: Sub the multiplicand from the left half of the product.
11: No arithmetic operation.
✔ Step 2:
Shift the product register right 1 bit.
Example

You might also like