Wallace-tree Multiplier

It is a tree structure which is used to reduce the number of ad

ditions in critical path.
Difficulty in the layout structure.
Reduces the number of partial products.
Built from carry-save adders:
Three inputs: a, b, c
Two outputs: y, z such that y + z = a + b + c
Carry-save equations:
y
i
= a
i
b
i
c
i

z
i+1
= a
i
b
i
+ b
i
c
i
+ c
i
a
i
Whats the difference from carry-ripple adder?

1
Wallace-tree Multiplier
Block diagram
2
6.3
FA FA FA
a
2

b
2
c
2

a
1

b
1

c
1
a
0

b
0
c
0

s
0
s
1
s
2

carry-
ripple
adder
FA FA FA
a
2

b
2
c
2

a
1

b
1

c
1
a
0

b
0
c
0

y
0

carry-
save a
dder
z
1
y
1
z
2
y
2
z
3

6.4
Wallace-tree Multiplier
6.5
Wallace-tree Multiplier Example





6.6
working
n additions are reduced to (2n/3) additions after each level
Sum of inputs = Sum of outputs
More efficient design uses 4-2 adders to reduce n additions to (n/2)
additions after each level

Need final adder to add the last two numbers
6.7