Professional Documents
Culture Documents
Combinational Logic Gates in CMOS: References
Combinational Logic Gates in CMOS: References
References:
Adapted from: Digital Integrated Circuits: A Design
Perspective, J. Rabaey, Prentice Hall © UCB
Principles of CMOS VLSI Design: A Systems Perspective,
N. H. E. Weste, K. Eshraghian, Addison Wesley
Adapted from: EE216A Lecture Notes by Prof. K. Bult ©
UCLA
Combinational vs. Sequential Logic
State
Combinational
Sequential
• Static CMOS
– Complementary CMOS
– Ratioed Logic
– Pass Transistor/Transmission Gate Logic
• Dynamic CMOS Logic
– Domino
– np-CMOS
Static CMOS Circuit
VDD
in1
in2 PUN PMOS only
in3
F=G
in1
in2 PDN NMOS only
in3
VSS
B X = Y if A = 1 or B = 1, i.e., A + B = 1
X Y
• Connect Y to GND
A B
X = 0 if A = 1 and B = 1, i.e., A.B = 1
X Y X = A.B
B
X Y X = 0 if A = 1 or B = 1, i.e., A + B = 1
X=A+B
B X = Y if A = 0 or B = 0
X Y A.B = 1
A+B=1
• Connect Y to VDD
A B
X = 1 if A = 0 and B = 0
X Y X = A + B = A.B
A
B X = 1 if A = 0 or B = 0
X Y
X = A.B = A + B
A + B = AB
AB = A + B
G (in1 , in2 , in3 ,...) ≡ F (in1 , in2 , in3 ,...)
• The complementary gate is inverting
– Implements NAND, NOR, …
– Non-inverting boolean function needs an inverter
≡
The NAND Circuit
A
0 1
A+ B
A B
0 1 1
B
A Out
1 1 0
B
A.B
A A
A.B 0 1
B
Output = A + B 0 1 0
B
A B 1 0 0
A+B
Example Gate: COMPLEX CMOS GATE
VDD
B
A
C
D
OUT = D + A• (B+C)
A
D
B C
F = ((A.B) + C.(A+B)) = carry
Remove
A B redundancy
A A B
A B C
C
B
output
output
B C B C
A A B A A B
Symmetrical !
F = (ABC+ABC+ABC+ABC) = sum
A -A -A A
-B B -B B
-C C
output
C -C
B -B -B B
A -A A -A
Full Adder Circuit
A A B A B C A
B
B C
C
-carry
-sum
C
B C
B
A A B A B C A
4-input NAND Gate
VDD
ln1 Out
Out ln2
ln3
ln4
GND
metal1 VDD
Well
VSS
Routing Channel
signals
polysilicon
Two Versions of (a+b).c
VDD VDD
x
x
GND GND
a c b a b c
VDD
x
b PUN
j c c
a x i VDD
x
b j a
c
i PDN
GND
a b
Consistent Euler Path
{a b c}
Example: x = ab+cd
x x
b c b c
x VDD x VD D
a d a d
GND GND
VD D
GND
a b c d
(c) stick diagram for ordering {a b c d}
Properties of Complementary CMOS Gates
• Assume CL dominates
• Assume Rn = Rp = resistance
of minimum sized NMOS
inverter
• For tpLH
– Worst case when only one
PMOS pulls up the output node
– tpLH ∝ RpCL
• For tpHL
– Worst case when two NMOS in
series
– tpHL ∝ 2RnCL
3-Input NAND Gate
inc out
inc out
If µn = 3µp
inb for equal fall and rise time:
Take Wn = Wp
ina
If µn = 2µp
for equal fall and rise time:
Take Wn = (3/2)Wp
Design for Worst Case
3-input NAND Gate with Parasitic Capacitors
P1 P2 P3
out
inc Cc Cp+load
N3
Cb
inb
N2
Ca
ina
N1
Worst Case Approximation
Using Lumped RC Model
td = Σ RiCi
with: Ci = capacitance at node i
Ri = total resistance between Ci and supply
R R R R R
C
C C C C
RC × n( n + 1) nR.nC
tn = ≈
2 2
RP-Model
tdf = [RNICa] + [(RN1+RN2)Cb] + [(RN1+RN2+RN3)Cc] +
CL = 0.0pF
CL = 0.5pF
CL = 1.0pF
t d = a1 FI + a2 FI 2 + a3 FO
ln1 ln2 ln3 ln4
ln2
• Fan-in: number of inputs to a gate
– Quadratic effect due to increasing ln3
resistance and capacitance
ln4
tp as a function of Fan-In
4.0
tpHL
3.0
tp (nsec)
2.0 quadratic tp
1.0
tpLH
linear
0.0
1 3 5 7 9
fan-in
P1 P2 P3
out
inc Cc Cp+load
1
Cb Rn=0.5Rp= 2 ×10 − 4
inb
Ca=Cb=Cc=Cj=0.05pF
Ca Cp=3Cj=0.15pF
ina
Cload=2Cg=0.20pF
Worst Case Approximation
by Lumped Model
tdr = Rp x (Cc + Cp+load) = 10000 x 0.4×10-12 = 4.0ns
= 7.5ns
Penfield-Rubenstein Model
Make Wn = 2Wp
= 4.875ns
Penfield-Rubenstein Model
Make Wn = 2Wp
td = [RN1(Ca + Cb + Cc + Cp+load)] +
[RN2 ( Cb + Cc + Cp+load)] +
[RN3(Cc+ Cp+load)]
td = Σ RiiCdownstream-i
with: Cdownstream-i = downstream capacitance at node i
Rii = resistance at node i
Progressive Sizing
consider distributed RC
effect
ln3 M3
• Increasing the size of M1 has
the largest impact in terms of ln2 M2
delay reduction
ln1 M1
• M1 > M2 > M3 > … > MN
Delay Optimization by Transistor Ordering
lnN MN lnN MN
ln3 M3 ln3 M3
ln2 M2 ln2 M2
ln1 M1 ln1 M1