Download
1 / 7
70 likes | 103 Views
Design and Implementation of VLSI Systems (EN1600) Lecture 26: Datapath Subsystems 2/4. Prof. Sherief Reda Division of Engineering, Brown University Spring 2008. [sources: Weste/Addison Wesley – Rabaey/Pearson]. For a full adder, define what happens to carry
E N D
Design and Implementation of VLSI Systems (EN1600) Lecture 26: Datapath Subsystems 2/4 Prof. Sherief Reda Division of Engineering, Brown University Spring 2008 [sources: Weste/Addison Wesley – Rabaey/Pearson]
For a full adder, define what happens to carry Generate: Cout = 1 independent of C G = A • B Propagate: Cout = C P = A B Kill: Cout = 0 independent of C K = ~A • ~B Last lecture we designed a carry-ripple adder PG summary
i k j k-1 The carry into bit i is the carry-out of bit i-1 The sum is equal to Group carry calculations
i k j k-1 Group generate
Carry-ripple adder revisited The critical path now proceeds through a chain of AND-OR gates rather than a chain of majority gates
8-bit adder/subtractor add/subt C0=Cin • Subtraction – complement all subtrahend bits (xor gates) and set the low order carry-in A0 1-bit FA S0 B0 C1 A1 1-bit FA S1 B1 C2 A2 1-bit FA S2 B2 C3 . . . C7 A7 1-bit FA S7 B7 C8=Cout
