Lect-3
Lect-3
VLSI Design
Jawar Singh
Indian Institute of Technology Patna
Key Properties of Complementary CMOS Gates
2.5
❑ Delay is dependent
Rp Rp A=B=1→0
on the pattern of 2
Voltage [V]
0.5
B
▪ both inputs go low 0
– delay is 0.69 Rp/2 CL Rn 0 100 200 300 400
Cint -0.5
▪ one input goes low A Input Data Delay
Pattern (psec)
– delay is 0.69 Rp CL
A=B=0→1 67
A=1, B=1→0 80
A= 1→0, B=1 81
RC Delay Models (Simplified)
Elmore Delay Model
Elmore Delay Model
Example: 3-input NAND
Sketch a 3-input NAND with transistor widths chosen to achieve effective
rise and fall resistances equal to a unit inverter (R).
B 8 6
A 4 3
C 8 6
D 4 6
OUT = D + A • (B + C)
A 2
D 1
B 2C 2
Fan-In and Fan-out Considerations
1250
A B C D 1000
quadratic
750
A CL
tpHL tp
500
B C3
250
C C2 Distributed RC model
linear
D
(Elmore delay) 0
C1 2 4 6 8 10 12 14 16
capacitance
❑ Fan-out: each additional fan-
out gate adds two gate
capacitances to CL
2 4 6 8 10 12 14 16
eff. fan-out tp = a1FI + a2FI2 + a3FO
Slope is a function of “driving strength”
Complex Gates: Design Technique 1
❑ Transistor sizing
▪ as long as fan-out capacitance dominates
❑ Progressive sizing Distributed RC line
InN MN CL
M1 > M2 > M3 > … > MN
(the fet closest to the
output is the smallest)
In3 M3 C3
In2 M2 C2 Can reduce delay by more than
20%; decreasing gains as
In1 M1 C1 technology shrinks
Complex Gates: Design Technique 2
❑ Transistor ordering
critical path critical path
charged 0→1
In3 1 M3 CL In1 M3 CLcharged
❑ Inverter has the smallest logical effort and intrinsic delay of all static CMOS gates
❑ Logical effort of a gate presents the ratio of its input capacitance to the inverter
capacitance when sized to deliver the same current
❑ Logical effort increases with the gate complexity
Example: Best Number of Stages
2-input NAND Gate
2-input NOR Gate
Logical effort of 2-input NAND and NOR gates
Logical Effort of Gates
2
=
p
3;
t pNAND
4/
5
Normalized delay (d)
=
g = 4/3 t pINV
p=
g
Normalized Delay
D:
p=2 1;
AN
d = (4/3)h+2
4 =
: g
tN
g=1 e r
ert
pu
3 v
in
p=1 In Effort
2-
d = h+1 Delay
2
F(Fan-in) 1
Intrinsic
1 2 3 4 5 6 7 Delay
Fan-out (h)
1 2 3 4 5
Fanout f
Multistage Networks Branching Effort
Example: Optimize Path
Assume we want to