Professional Documents
Culture Documents
3.3Vdc Vdd
U1A
1
A 3 0
2 Vout
B CL
7400
0 1n
Fig.1 Circuit to illustrate the definition of Fig.2 Graph of delay time v/s load
of gate delay capacitance
1
Ru =
FET unit Resistance is given by W
k' (V DD − VT )
L
Where
Ru is unit transistor Resistance, W and L are the width and Length of the transistor, K’
Ru
is µ n C ox Rm = , C Gm = mC Gu , C Dm = mC D u , C Sm = mC S u
m
-2-
Wmin = Wu
Fig.3 shows the layout of FET and Fig.4 shows the scaled FET, 3 times the
original size. The parasitic capacitances for unit size FET are given by
C Gu =C OX (WL) u
C Du = (C GD + C DB ) u
C Su = (C GS + C SB ) u
where CGu, CDu and Csu are the Gate, Drain and Source Capacitances. The width of
unit size FET is the minimum size given by Wmin = Wu. Fig.4 shows the scaled FET
with m = 3. The aspect ratio becomes 3 times the unit FET and the aspect ratio also
become e times unit FET. In general, the size of scaled FETs are integer multiples of the
minimum
W W
(W ) 3 = 3Wu = 3
L 3 L u
2
-3-
It can be seen from the above expressions that, the capacitances are increased 3
times and the resistance is decreased by 3 times. But, an important observation is that, the
RC product remains same RmCm=RuCu.
Rx = 3Ru , C Gx = 3C Gu , C Dx = 3C D u , C Sx = 3C S u
t r = t LH
t f = t HL
R
R3 = u
3
CG 3 = 3CGu
C D 3 = 3C D u
C S 3 = 3C S u
If we connect the minimum size FET for both PMOS and NMOS as shown in
Fig.5, results in an inverter. The layout of the inverter is shown in Fig.6.
V1
3.3Vdc
M1
0
in
out
M2
0
3
-4-
While drawing the layouts of VLSI circuits, Design rules has to be followed.
Some of them has been narrated in fig.8 and it states that,
1) The width of n+/p+ diffusion should be of minimum width 2l and the gap between two
diffusions should also be 2λ.
4
-5-
2) The gap between diffusion and the poly has to be of minimum width λ.
3) The width of metal1 should be of minimum width 3λ and the gap between two metal1’s
should be 4λ and similar other rules has to be followed while drawing the layouts in VLSI
circuits.
Cell Concepts: The basic building block s in physical design are called cells. A cell may
be as simple as an FET, or as complex as an arithmetic logic unit (ALU). The basic cells
of inverter, NAND2, and a cell consisting of inverter, NAND2 and one more inverter at
the output are shown in fig.9. Also the complex cell showing only the inputs and output
have been narrated. This is the usefulness of the cell concept. This becomes useful in
writing VHDL code in behavioral mode.
XNAND2
XNOT
Vdd
Vdd
in1 U2A
1
in 1 2
out 2
3
out
7406
in2 7400
Gnd
Gnd
10.00V
V1
10V
M1 M2
IRF9140 IRF9140
0V
0
10.00V
V1 = 0v R1
VA
V2 = 10v M3 47K
TD = 0US 0V
TR = 0.1us 0V
TF = 0.1US IRF150 0
PW= 1Us 0
PER = 2Us
0V
5.000V
M4
IRF150
V1 = 0v
VB 0V
V2 = 10v
TD = 0US 0
TR = 0.1us
TF = 0.1US
PW= 0.5Us 0
PER = 1Us
5
-6-
3
t r = t ro + α pu C L
2
t f = 3t fo + 2α n u C L
If we scale the FETs with m = 3, then α factors are reduced by 1/m because of the
decrease in Resistance. The decrease in resistance counteracts the in crease in CFET, so
that the zero-load terms are unchanged. Thus, the switching equations for m-scaled
NAND2 gate and for an N-input NAND2 gate using m-scaled FETs becomes
3 α N + 1 α pu
tr = tro + pu CL tr = tro + CL
2 3 2 m
2α Nα
t f = 3t fo + n u CL t f = ( N + 1)t fo + nu CL
3 3
Analysis of NOR2 gate can be analyzed in a similar manner. The switching equations for
m-scaled NAND2 gate and for an N-input NAND2 gate using m-scaled FET’s becomes
tr = 3tro + 2α puCL Nα
tr = ( N + 1)tro + pu CL
m
3
t f = t fo + α nuCL N + 1 αn
2 tf = t fo + u CL
2 m
The above switching equations clearly demonstrate the dependence on the number
of inputs (N) and the FET Scaling factor (m).
Delay time: The above technique of gate design provides a structured approach for
estimating delays. Fig.13 shows a logic chain with M-stages, the total delay, td is given by
M
the summation of individual 0delays. Mathematically, t d = ∑ t i
2 i =1
1 1
1 3 3
1 2 2
in
6
C3 C= 4 Cmin
C2
C1 0
-7-
Fig.13 shows a logic chain with Inverter, NAND and NOR gates in the 1st, 2nd and
3 stages and load capacitor in the 4th stage.
rd
The stages are scaled with increasing values of m. This is necessary to take the
additional load of previous stages. The output capacitance has to have scaling of 4, as it is
in the 4th stage in the chain. The total delay is given by,
t d = t NOT / m =1 + t NAND 2 / m= 2 + t NOR 2 / m = 3
For the given inputs to the logic chain, the switching equation for NOT gate is of
tfo, This is because the output of the NOT gate is falling from HIGH to LOW. Similarly, it
can be seen that, NAND gate switching equation is of tro and for NOR gate is that of tfo, as
the output of NAND gate is rising from LOW to HIGH and that of NOR gate is falling
from HIGH to LOW.
Applying the corresponding switching time equations, we get,
t NOT / m =1 = t f 0 + αnu 2C min
αpu
t NAND 2 / m =2 = t r 0 + 3C min
2
3 α
t NOR 2 / m =3 = t f 0 + nu 3C min
2 2
So the total delay in the chain is,
5 3 10 3
t d = t fo + t ro + α nu C min + α pu C min
2 2 3 2
It is important to note that, the expression for td will change if different inputs are
applied. Overall, the technique allows us to estimate delays through logic cascades in a
uniform manner.
7
-8-
VM = 1.358 V
8
-9-
VDD − / VTP / + VTn x β n 3 − 0.82 + 0.6 x β n
βp βp
VM = = = 1.3V
βn βn
1+ 1+
βp βp
βn
= 1.580
βp
VLSI Circuits - Prof.M.J.Shanthi Prasad, HOD of E & C, BIT, Bangalore
7.3 VDD = 5 V
VTP = -0.7 V
VTn = 0.6 V
β n = 2.1µA / V 2
β p = 1.8µA / V 2
a) To find VM
VM = 2.378 V
b) To find Rn and Rp
From Equation 7.28
1 1
Rn = = = 108Ω
β n (VDD − VTn ) 2.1( 5 − 0.6 )
1 1
Rp = = = 129Ω
β (V − / V / ) 1.8( 5 − / 0.7 / )
p DD Tp
9
- 10 -
60
Rise time
40
20
0
1 2 3 4 5
Load Capacitance
50
Fall time
0
1 2 3 4 5
Load Capacitance
10
- 11 -
VTn = 0.6V
Kn’ = 150 µA/V2
Kp’ == 60 µA/V2
To find VM, From Eqn.6.109
W 4
β n = k n ' = 150 x = 600 µA / V 2
L n 1 n
W 8
β p = k p ' = 42 x = 480 µA / V 2
L p 1p
VLSI Circuits - Prof.M.J.Shanthi Prasad, HOD of E & C, BIT, Bangalore
VM = 2.244 V
L n 0.8
W 4
β p = k p ' = 60 = 600 µA / V
2
L p 0.8
a) To find Cin
From Equation 6.115
C GP = C ox (WL ) p = 2.7( 8 x0.8) = 17.28 f F
C Gn = C ox (WL ) n = 2.7( 4 x0.8) = 8.64 f F
From Equation 7.30
Cin = CGn + CGP = 25.72 fF
b) To find Rn and Rp
From Equation 7.28
11
- 12 -
1 1
Rn = = = 303Ω
β n (VDD − VTn ) 750 x10 x( 5 − 0.6 )
−6
1 1
Rp = = = 387Ω
β (V − / V / ) 600( 5 − / 0.7 / )
p DD Tp
c) To find tr and tf
From Equation 7.52 t f = 2.2τ p
From Equation 7.32 τ p = R p C out , C out = C L + C FET
VLSI Circuits - Prof.M.J.Shanthi Prasad, HOD of E & C, BIT, Bangalore
Similarly, Cn = Cjn Abot + Cjsnw Psw = 0.86 x 8 x 2.1 + 0.24 x 2(4 + 2.1) = 10.15 fF
CDn = Cn + CGn/2 = 10.15 + 8.64/2 = 14.47 fF
VM = 2.523 V
7.8 Given Data:
VDD = 3.3 V
VTP = -0.8 V
VTn = 0.65 V
βp = 2.2βn
From Equation 7.98, Mid-point voltage of NOR2 gate is
12
- 13 -
VDD − / VTP / + VTn xNx β n 3.3 − 0.8 + 0.65 x 2 x β n
βp 2.2 β n
VM = = = 1.438V
β βn
1 + Nx n 1 + 2x
βp 2.2 β n
VM = 1.438 V
To find β p
W 4
β n = k n ' = 120 x = 480 µA / V 2
L n 1 n
Solving, β p = 60 µA/V2
7.10 Given Data:
Cout = 130 fF
C1 = 36 fF
C2 = 36 fF
βn = 2 mA/V2
VDD = 3.3 V
VTn = 0.7 V
From Equation 7.28
1 1
Rn = = = 192Ω
β n (VDD − VTn ) 2 x10 x( 3.3 − 0.7 )
−3
13
- 14 -
a) Applying the Elmore formula as illustrated in page 268 of Uyemura, we get the
discharge circuit and the discharge time constant for fig.P7.1,
Rn
τ n = C out ( Rn + Rn + Rn ) + C 2 ( Rn + Rn ) + C1 ( Rn )
Cout
Vout τ n = 130( 3 x192 n ) + 36( 2 x192 n ) + 36(192 ) = 95.216 ps
Rn
C2
0
Rn C1
0
0
0 VLSI Circuits - Prof.M.J.Shanthi Prasad,
HOD of E & C, BIT, B’lore
b) τ n = C out ( Rn + Rn + Rn ) = 130 x3 x192 = 74.88 ps
τ ( a ) − τ n ( b)
% error = n x100% = 27.16%
τ n (a)
Rn
Cout
Vout
Rn
0
Rn
14
- 15 -
7.11 The logical circuit for the Boolean expression, f = a.b + c.d .e is given by
M2 V1
M2 3.3Vdc
a b
0
M2 M2 M2
d e
f
M1 M1
a c
M1
0 0
d
M1 M1
b e 0
0
0
0
VLSI Circuits - Prof.M.J.Shanthi Prasad, HOD of E & C, BIT, Bangalore
15
- 16 -
M2 V1
3.3Vdc
Y
M2
X M2 0
Z
M2 M2
X W
MbreakP MbreakP
f
M1 M1
X X
0 0
M1 M1 M1
W
Y Z
0
0 0
16
- 17 -
a) Inverter
t r = t ro + α p C L
t f = t fo + α n u C L
If β n = β p , then tr = tf = ts
t s = t o + αC L Wn = Wmin and Wp = r Wmin, Cin = Cu(1 + r) = Cinv
17
- 18 -
t d , N = ( x1 )
N −1
(A + Bn)τ min
For Example, if the increase from N = 1 to N = 2 is 17% per
input, this means that, x1 = 1.17 and
t d , N = (1.17 ) (A + Bn)τ min
N −1
For a complex N-input logic gate, the charging and discharging times will increase
further by 5 to 20% and we can account that by including one more empirical fitting
parameter x2 >1, to obtain
B
t m d , N = x 2 ( x1 ) (A + n)τ min
N −1
18
- 19 -
td
if x1=1.17, = 2.17 A + 6.1B
t min
is the delay compared to a single inverter. It may be noted from equation 8.32 that,
td
the delay of a single inverter is = A+ B
t min
In general, the design of high speed logic CMOS logic networks is done by using
different algorithms and different types of logic cascade. This provides a basis for
deciding on the design that will be the fastest.
M1
MbreakP Load
Vin Vout
M2
CL
MbreakN
1
Rn = R p = R =
β (V DD − VT )
This design yields a voltage transfer characteristic (VTC) with a
midpoint voltage of VM=VDD/2 and equal rise and fall times. For a 0-to-1 transition at the
output, the output voltage across CL is of the form,
Vout (t ) = V DD 1 − e −t / τ [ ]
VLSI Circuits - Prof.M.J.Shanthi Prasad, HOD of E & C, BIT, Bangalore
19
- 20 -
Vout (t ) = V DD e − t / τ
where τ is the time constant given by
τ = RC out = R ( C FET + C L )
Unit load: The load is said to be of unit value, if the gate’s load capacitance is the same
as the gate’s own input capacitance. This situation exists, if the inverter of fig.16 is
driving the symmetrical inverter as shown in fig.17.
Cin = CGn + CGp = Cox(AGn+AGp) = CoxL(Wn + Wp) = (1 +r)(CoxLWn) = (1 + r) CGn
Where AGn and AGp are the gate areas of the respective devices.
VCC VCC
Cin
M1 M1
MbreakP MbreakP
Vin Vout
M2 M2
MbreakN MbreakN
20
- 21 -
If CL = SCin as in Fig.18, then the switching time is the same as for a unit load. Thus the
compensation factor (1/S) allows us to drive larger CL.
VCC VCC
CL,d=Cin
M1 M1
MbreakP MbreakP
Cin,d Beeta large
Vin
M2 M2
CL large
MbreakN MbreakN
Beeta large
Driving Stage
1 2 1 2
1 2 1 2
Ci
β1 β2 β3 βN-1 βN
3
1 2
CL
0
Fig.19 A chain of inverters to illustrate the steps to minimize the delay
Fig.19 shows the large capacitance CL driven by a large inverter gate (N), which
is driven by a smaller gate (N-1) and so on. The first stage (β1) is a standard size inverter
of unit size. The stages are monotonically increasing such β1 is the smallest and βN is the
largest. The sizes of FETs are increased stage by stage by scaling with a factor of S, such
that
21
- 22 -
R1 2
S C 1 + R21 S3 C1 + ……….+ N1-2 S N -1C1 + N1-1 S N C1
R R
td = 2.2(R1SC1 +
S S S S
td = 2.2(R1SC1 + R1SC1 + R1SC1 + …….+ R1SC1 + R1SC1) =2.2 N S R1C1 = 2.2 NS τ r
So to minimize the delay, the unit resistance and capacitance has to be kept minimum and
also by properly selecting the scaling factor, S.
To derive the condition for minimum delay
From Equation 8.72, CL = SNC1
C
ln(S N ) = ln L
C1
CL
ln
C1
N =
ln(S)
C S
t d = 2.2 ln L . This is only a function of S.
C1 ln ( S )
22
- 23 -
or ln(S) = 1 or S = e
That is the euler e = 2.71… is the scaling factor for a minimum delay.
C
ln L
C C
N = 1 = ln L
ln ( S ) C1
CL
The total delay through the chain is τ d = e ln τ r
C
1
23
- 24 -
Rj
(Beeta)j+1
Cj
CF,j
Rj 1n
0 (Beeta)j+1
Cj+1
1n
0 0 0
As FETs have to drive both CF,j and Cj+1, the delay time constant now becomes
τ j = Rj ( C F, j and Cj + 1)
As FET capacitance is proportional to the width of the FET, so that the scaling relation is
C F , j = S ( j −1) C F ,1
where CF,j is the capacitance of the first stage
The delay time constant for the entire chain is
τ d = R1 ( C F,1 + C 2 ) + R2 ( C F, j + C 3 ) + ....... + R N ( C F,N + C L )
Using equations 8.65, 8.69 and 8.88, the above eqn. Becomes
τ d = NR1C F ,1 + N ( SR1C1 )
Using eqn.8.75 for N
τ S CL
τ d = x +τ r ln where τ x = R1C F ,1
ln ( S ) ln ( S ) C1
24
- 25 -
To get the condition for minimum delay, the above eqn. is differentiated with respect to S,
τ
S [ ln ( S ) −1] = x which is a transcendental equation and its solution is dependent on the
τr
τx
ratio
τr
VLSI Circuits - Prof.M.J.Shanthi Prasad, HOD of E & C, BIT, Bangalore
0
Fig.21 Circuit of 1x inverter used to define logical effort
C
g = in
C ref
where Cref is the same as the input capacitance of the 1x inverter.
Electrical Effort:
The symbol of Electrical effort is h and is defined by the ratio of the output capacitance
to that of the input gate. It indicates the electrical drive strength that is required to drive
its own input capacitance Cin.
C
h = out
C in
Delay time:
The absolute delay time is given by
d abs = kRref ( C p ,ref + C out ) sec
With scaling, the resistance decreases by a factor of S and capacitance increases as
follows:
25
- 26 -
R ref
R= and C p = SC p ,ref
S
VDD
Rref
Cout
Cp,ref
1n
0
Rref
Parasitic internal
0
Fig.22 Circuit used to define the delay time of 1x inverter with parasitic capacitance
26
- 27 -
1 2 1 2
C1 C2 C3
C2
1n
0
C last
The path electrical effort is defined as the ratio of H = and this can be expressed as
C first
the product H = h1h2
Condition for minimum delay with parasitic capacitance
It is derived by differentiating D with respect to h1 and equating it to zero.
H
D = ( h1 + p1 ) + + p 2
h1
∂D ∂ H
= ( h1 + p1 ) + + p 2
∂h1 ∂h1 h1
The parasitic terms p1 and p2 are constants to the differentiation,
∂D H
= 1− 2 = 0
∂h1 h1
using H = h1h2,
Thus the condition for minimum delay is h1 = h2
Logical effort for NAND2 and NOR2 gates
Fig.24 shows a 1x NAND2 gate. The pFET transistors sizes are still r, since the
worst case path from the output to the power supply is the same as an inverter. The
nFETs, however, must be twice as large as the inverter values since they are in series.
Their relative values are denoted as beiong 2. For either input,
VDD VDD
r r 2r
Cout 2r r
2
Cin 1 1 Cout
Cin
2
0 0 0
27
- 28 -
C Gn (!+2r ) !+2r
g NOR2 = =
C ref 1+ r
Logical effort for n-input NAND and NOR gate
The input capacitance is then
C in = C Gn (n + r ) , so that the logical effort for the NAND2 gate is
C ( 2 + r) n + r
g NAND2 = Gn =
C ref 1+ r
The input capacitance is then
The path logical effort is just the product of the individual factors
N
G = ∏ g i =g1 g 2 ..g N
i =1
The path electrical effort is just the product of the individual factors
N
H = ∏ hi =h1 h2 ..hN
i =1
Combining logical effort and electrical effort gives the path effort
F = GH = ( g1 h1 )( g 2 h2 )( g 3 h3 )....( g N hN )
^
A minimum delay through the cascade is achieved if gh = f for every i
28
- 29 -
This is consistent with our conclusions for the simple 2-stage inverter chain. The
^
optimum path effort is thus F = f N so that the fastest design is where each stage has
^ 1
stage logic chain allows us to find the value of F. Each staged can be sized to
accommodate the optimum electrical effort value
^
N
f
, The optimized path delay is then D = NF N + P where P = ∑ Pi . It is
1
hi =
gi i =1
In general, Pref for an inverter is the smallest, with multiple-input gates exhibiting
larger parasitic delay times. One simple estimate is to write P = nPref . It is the parasitic
delay for an n-input gate.
8.3.5 Branching:
When the logic gate drives two or more gates, the data path splits. The
capacitance contributed by the off path should also be considered in to account. Fig.21
29
- 30 -
2
1 (Node)2
In 1 3
1 22
3
Out
1
3 1 2
2
(Node)1
2
1
3
30
- 31 -
VDD
CMOS Q1
logic
inputs and Cout
driving Q2
0
circuits 0
0
Fig.27 General form of a BiCMOS circuit
Q1
M1 Vout
Mn
Vin 0 Cout
Q2
0
0
M2
0
A BICMOS NAND2 circuit: The CMOS circuitry can be modified as shown in fig.23.
The logic is performed by the parallel pFETs driving Q1, and the series nFETs between
the collector and the base of Q2. The other FETs are used as pull-down devices to turn off
the output transistors. Other logic functions cazn be designed using this as a basis. In
general, the upper output transistor uses a standard-design CMOS circuit as a driver. The
nFET section is replicated and placed in between the collector and base of the lower
output transistor; adding a pull-down nFET to the base completes the design.
31
- 32 -
VDD
Q1
Cout Vout
B 0
0
A
Q2
td
CMOS
BiCMOS
Cx CL
32
- 33 -
Rn = Rp = 990/2.2 = 450 Ω
33
- 34 -
Multiplying Eqn (1) by 100 and eqn (2) by 115 and by solving we get,
tro = 24.75 ps
34
- 35 -
1500
Rise Time
1000
500
0
1 2 3 4 5
Load Capacitance
1000
Fall Time
500
0
1 2 3 4 5
Load Capacitance
b)
1 1
1 1 2 1 2 1 2
CL CL CL
0
0 0 0
Fig.31 Circuit of problem 8.2
VLSI Circuits - Prof.M.J.Shanthi Prasad, HOD of E & C, BIT, Bangalore
Three-inverter cascade is built using identical inverters. If the input to first stage of
inverter is assumed to rise from low to high, the output of first stage falls from high to
low. So, the switching equation of tf applies. As shown in fig.16, the switching equation
of tr and tf applies to the second and third stage outputs.
tNOT/m=1 = tfo + αnu 2CL
tNOT/m=2 = tro + αpu 3CL
tNOT/m=3 = tfo + αnu 4CL
The total time delay is the sum of all the above individual gate delays.
td = 2tf0 + tr0 + αnu 6CL + αpu 3CL
From the given equations, tf0 = 300, tr0 = 430, αnu = 2.56, αpu = 3.68, CL = 45 fF
td = 2 x 300 + 430 + 2.56 x 6 x 45 + 3.68 x 3 x 45 = 265.1 ps
35
- 36 -
8.3 As the input to first stage of inverter rises from high to low, the output of first stage
falls from low to high. So, the switching equation of tr applies. As shown in fig.32, the
switching equation of tf, tr and tf applies to the second, third and fourth stage outputs.
m=3
1
A 1 2 2
m= 2 31 2
3
m=1 12
m=1 10 Cmin
1 2
0
m=2
Fig.32 Circuit of problem 8.3
tNOT/m=1 = tr0 + αpu 2Cmin
α pu
tNOR2/m=1 = 3tro + 2Cmin
2
tNAND2/m=2 =3tfo +2 αnu 3Cmin
The total time delay is the sum of all the above individual gate delays.
td = 3tf0 +5tr0 +8α nuCmin + 5α puCmin
36
- 37 -
CL
c) τ d = NSτ r = e ln R1C1
C1
To calculate the delay time in the chain, information about C1 and R1 is needed.
CL 40 x10 −12
8.5 As N = ln = ln = 6.68 ≈ 7
−15
C1 50 x10
The number of stages = 7
1
C N 1
S = L = ( 800 ) 7 = 2.6
C1
The relative sizes are decided by the values of their β values
β2 = (2.6)β1
β3 = (2.6)2β1 = 7 β1
β4 = (2.6)3β1 = 17 β1
β5 = (2.6)4β1 = 45 β1
β6 = (2.6)5β1 = 1167 β1
β7 = (2.6)6β1 = 302 β1
where we have rounded to the nearest integer.
τx
8.7 Equation 8.93 is S [ ln ( S ) −1] = and for τ x = 0.72τ r , the eqn. Become
τr
37
- 38 -
Sl.no. τx Solution S
τr
1 0.2 2.91
2 0.5 3.18
3 0.72 3.32
4 1 3.59
i.e. C2 = 8.8
C1 U5A C C3 C4
1 U2A
2 12
1 U3A
U4A
13 2 3
C = 0.1 CL 7410
2
3
11 2
7400 7405
7402 CL
r = 2.5
Fig.33 Circuit of problem 8.7
Substituting the values of g for all the gates from eqns 8.130, 8.131 & 8.103, we get
3 + r 2 + r 1 + 2r 5.5 4.5 6
G= x x x1 = x x x1 = 3.46
1+ r 1+ r 1+ r 3.5 3.5 3.5
CL CL
The path electrical effort is H = = = 10
C1 0.1CL
The path effort is F = GH = 3.46 x 10 =34.6
^ 1 1
The optimum stage effort is f = F N = ( 34.6) 4 = 2.43
38
- 39 -
^
f 2.43
hi = , h1 = = 1.54
gi 1.5714
C i +1
But as per eqn.8.116, the electrical effort is hi = , i = 1 to N
Ci
C2 C2
∴ h1 = = , so that, C2 = 0.154CL
C1 0.1C L
This NAND3 gate can be scaled by using eqn.8.125 as
C in = S1C Gn ( 3 + r ) i.e. C1 = S15.5CGn
The remaining gates are analyzed in the same manner.
^
f 2.43
As gNAND2 = 1.2857, hi = , h2 = = 1.8929
gi 1.2857
C C3
∴ h2 = 3 = , so that, C3 = 0.291CL
C 2 0.154C L
This NAND2 gate can be scaled by using eqn.8.125 as
C in = S 2 C Gn ( 2 + r ) i.e. C2 = S24.5CGn
^
f 2.43
As gNOR2 = 1.71, hi = , h3 = = 1.421
gi 1.71
C C4
∴ h3 = 4 = , so that, C4 = 0.413CL
C 3 0.291C L
This NOR2 gate can be scaled by using eqn.8.127 as
C in = S 3 C Gn (1 + 2r ) i.e. C3 = S36CGn
^
f 2.43
As gNOT = 1, hi = , h4 = = 1.421
gi 1.71
C CL
∴ h4 = L = , so that, CL = CL as required
C 4 0.413C L
This NOT gate can be scaled by using eqn.8.127 as
C in = S 4 C ref i.e. C4 = S4Cref
39
- 40 -
8.10
1
3 2
2 1
3
7400
2
1
10C1
3
C1 1
2 12
13
When the logic gate drives two or more gates, the data path splits. The
capacitance contributed by the off path should also be considered in to account. Once the
branching effort B has been calculated, the path effort gets modified to F=GHB and the
remaining calculations proceeds in the same manner as without branching.
Path logical effort as per equn.8.135 is G = g NOR 2 g NAND 2 g NOR 2
Substituting the values of g for all the gates from eqns 8.130, 8.131 & 8.103, we get
1 + 2r 2 + r 1 + 2r 6 4.5 6
G= x x = x x = 1.71x1.29 x1.71 = 3.78
1+ r 1+ r 1+ r 3.5 3.5 3.5
40
- 41 -
^ 1 1
The optimum stage effort is f = F N = ( 84 ) 3 = 4.38
Where P is the parasitic delay. As per eqn. 8.143, P = PNOR 2 PNAND 2 PNOR 2 and P of each
gate is determined by the process specifications.
41
- 42 -
C2 1.114 x0.1C L C
S2 = = = 0.0248 L
4.5C Gn 4.5C Gn C Gn
The scaling factor of output NOR2 gate is
C 3.9 x0.1C L C
S3 = 3 = = 0.0709 L
6C Gn 5.5C Gn C Gn
42