Carry-Save Array Implementation
a3b0 a2b0 a1b0 a0b0
a3b1 a2b1 a1b1 a0b1
a3b2 a2b2 a1b2 a0b2
a3b3 a2b3 a1b3 a0b3
s7 s6 s5 s4 s3 s2 s1 s0
+
+
+
Dangling inputs connected to 0
Given N-bit inputs, delay of multiplier grows as
Can improve throughput using pipelining.
Previous slide
Next slide
Back to first slide
View graphic version