Lecture 8: Fast Multiplication

EEE 105: Computer Organization

Bit-Pair Recoding
Some Booth multiplier pairs can be recoded further
(+1 -1) = 2n+1 2n = 2n = (0 +1)
(+1 0) = 2n+1 = 2 x 2n = (0 +2)
Original Multiplier

Booth

Bit-Pair

i+1

i-1

i+1

+1

+1

+1

-1

+1

+1

+2

-1

-2

-1

+1

-1

-1

-1

Bit-Pair Recoding
x

0
1

1
1

1
0

0
1

1
0

(13)
(-6)

0
0

1
-1

1
-2

(13)
(-6)

1 1 1 1 1 0 0 1 1 0
1 1 1 1 0 0 1 1
0 0 0 0 0 0
____________________________
1

0 (-78)

Ripple Addition
We wish to add 3 numbers P, Q, and R (each 3-bits wide)
S = P + Q + R
S = (P + Q) + R
S = X + R

Critical path: 5 Adders

4

Carry-save Addition
Operands and carry-in of
adder interchangeable
Use carry-in to add third
operand instead
Add carry-outs in
succeeding stage

Critical path: 4 Adders

5

Carry-save Network Construction

Add four numbers N, P, Q, and R (Each 3 bits wide)
Ripple implementation would have 3 levels
Ripple implementation critical path is 6 adders
Carry-save construction: Add 3 bits at a time

Carry-save Network Construction

Each full adder produces

Sum bit (white)
Carry out bit (gray)

Carry-save Network Construction

Grouping by 2 uses Half Adder (HA)

Carry-save Network Construction

Critical path: 5 Adders

Carry-save in multiplication

Critical Path: 6 Adders

10

Carry-save in multiplication

We actually have an extra carry-out,

but this will always be 0

11

Reference

Hamacher et al. Computer Organization, 4th ed.

Hayes. Computer Architecture and Organization, 5 th ed.

12