Professional Documents
Culture Documents
CC are circuits without memory where the outputs are obtained from the inputs only. A n-input m-output combinational circuit is of the form
i1 Combinational Circuit in
o1
om
where, oi = f (i1, . . . , in), 1 i m. Half/Full adder/substractor Binary ripple adder/substractor Look-ahead carry adder Code converter, Encoder/Decoder Magnitude comparator Multiplexer/Demultiplexer Read-only memory Programmable logic array Programmable array logic Arithmetic logic unit
1
ADDERS AND SUBSTRACTORS Half Adder Adds 2 bits and outputs carry and sum x 0 0 1 1 c= y 0 1 0 1 c 0 0 0 1 s 0 1 1 0
x y s
s=
Full Adder Adds previous carry and 2 bits and outputs new carry and sum x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 c 0 0 0 1 0 1 1 1 s 0 1 1 0 1 0 0 1 K-map for c x\yz 00 01 11 0 1 1 1 1 c= K-map for s x\yz 00 01 11 0 1 1 1 1 s= 10 1 10 1
x y
c z
2
Binary Ripple Carry Adder Adds 2 n-bit numbers and outputs carry-out and sum
Input carry of FAi = output carry of FAi1 Simple, easy and cheap design
Reusable
Very slow
Carry Lookahead Adder Faster than BRCA but more complex FA = Partial Full Adder + Ripple Carry Path
Ai Bi Pi Si Gi Ci Ci+1
C4
A solution to BRCA problem is to replace the RCP by a two-level circuit (2 gate delays) How: Each Ci is a function of Gi1, Pi1 and Ci1, that is Ci = f (Gi1, Pi1, Ci1) = Gi1 + Pi1Ci1. Generate a SOP expression for each Ci and obtain its two-level circuit implementation.
4
Carry Lookahead Adder (continued) Ci = Gi1 + Pi1Ci1 for 1 i n C1 = G0 + P0C0 C2 = G1 + P1C1 = G1 + P1(G0 + P0C0) = G1 + P1G0 + P1P0C0 C3 = G2 + P2C2 = G2 + P2(G1 + P1G0 + P1P0C0) = G2 + P2G1 + P2P1G0 + P2P1P0C0 C4 = G3 + P3C3 = G3 + P3(G2 + P2G1 + P2P1G0 + P2P1P0C0) = G3 + P3G2 + P3P2G1 + P3P2P1G0 +P3P2P1P0C0 = G03 + P03C0 G03 = G3 + P3G2 + P3P2G1 + P3P2P1G0 P03 = P3P2P1P0 Pi = Propagate funtion: propagate a carry from position i to
i+1
G0...3
P0...3 P3 G3
C3
P2 G2
C2 P1 G1 P0 G0 C0 C1
Four-Bit Carry Lookahead Adder (continued) 4-bit FAs with carry lookahead circuit
G0...3 B3 A3 P3 P0...3 P3 C3 G3 S3
B2 A2
P2 S2
G2
B1 A1
P1
P1 C1 S1
G1
B0 A0
P0
P0 S0
G0 C0 C0
More expensive than RCP but much more faster 4-bit CLAs can be used to implement circuits for adding 8, 12, 16, . . . , 4n-bit numbers
7
Substractors
Half Substractor, Full Substractor, Binary Ripple Borrow Substractor and Borrow Lookahead Substractor can be dened in the same way as done for the adders. Instead of carry and sum we have borrow and dierence, and dierent truth table and circuits
Exercise to submit in next lab Dene and implement a Half Substractor, a Full Substractor and a Binary Ripple Borrow Substractor. Youll have a bonus if you implement a Borrow Lookahead Substractor. Note: itll be marked
Hint: Remember the relationship between binary addition and binary substraction operations
Adder-Substractor Circuit