This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: I 1 I 2 S S 1 I 3 Carry Save Adder 3=>2 I 1 I 2 S S 1 I 3 Carry Save Adder 3=>2 I 1 I 2 S S 1 I 3 S S 1 S 2 S 3 S 4 Carry Save Adder 3=>2 I 1 I 2 S S 1 I 3 Carry Save Adder 3=>2 I 1 I 2 S S 1 I 3 Carry Save Adder 3=>2 I 1 I 2 S S 1 I 3 B 2 A 2 C 1 B 1 A 1 C B A D D 1 D 2 3 1. Draw a complete 4 x 4 multiplier that takes two fourbit numbers (call the input bits A3 … A0 and B3 … B0), and which outputs an 8bit result (M7 … M0). Use a carrysave architecture for this, use as little hardware as possible, and assume that the numbers are unsigned : 2. Is there any way to use an architecture like this for signed numbers? Give short explanation....
View
Full Document
 Fall '04
 Kubiatowicz
 Addition, Computer Architecture, Carrysave adder, Carry Save Adder, Carry Save Adders

Click to edit the document details