Logical Effort and Sizing a Path

Size the gates of a path for the least delay with logical effort, and choose how many stages a large load needs.

You Will Be Able To

  • Write the delay of a stage as g·h + p and say what each letter stands for.
  • Compute the path effort F = G·B·H of a path with a branch.
  • Size each stage of a path for equal stage effort.
  • Choose the number of stages that drives a large load fastest.
Lesson
G9.7
Time
35 min
Runs on
ngspice
Check
5 questions

A unit inverter had to drive a load of 64 unit inverters. Alone it needed 583.4 ps. Two more inverters between it and the load, each four times the size of the one before, cut that to 185.9 ps. More gates on the path made it faster.

TransientThree Inverters of Sizes 1, 4 and 16 Drive a Load of 64Each stage is four times the one before it, so each sees the same fan-out of 4.
  • v(in)
  • v(n1), size 1
  • v(n2), size 4
  • v(n3), size 16
-0.5 V00.5 V1.0 V1.5 V2.0 VVoltage00.5 ns1.0 ns1.5 ns2.0 ns2.5 ns3.0 nsTimehalf of the supplythe load switches after 177.3 ps-0.5 V00.5 V1.0 V1.5 V2.0 VVoltage01 ns2 ns3 nsTimehalf of the supplythe load switches after 177.3 ps
  1. Time 225 psv(in) = 900 mV · v(n1), size 1 = 1.867 V · v(n2), size 4 = 1.338 mV · v(n3), size 16 = 1.8 V

    The input rises through 0.9 V. The first inverter is a unit inverter, so the input sees a small load.

  2. Time 270.1 psv(in) = 1.8 V · v(n1), size 1 = 900.2 mV · v(n2), size 4 = -29.87 mV · v(n3), size 16 = 1.798 V

    The first stage, size 1, drives size 4. It crosses 0.9 V after 45.1 ps. Its input is a sharp 50 ps edge.

  3. Time 338.3 psv(in) = 1.8 V · v(n1), size 1 = 25.94 mV · v(n2), size 4 = 899.7 mV · v(n3), size 16 = 1.848 V

    The second stage, size 4, drives size 16. It takes 68.1 ps more, since its input edge comes from a real gate.

  4. Time 402.3 psv(in) = 1.8 V · v(n1), size 1 = 23.8 mV · v(n2), size 4 = 1.622 V · v(n3), size 16 = 900.3 mV

    The last stage, size 16, drives the load of 64 in 64.1 ps. Both later stages have a fan-out of 4 and take about the same time.

Read the plot as a table
Timev(in)v(n1), size 1v(n2), size 4v(n3), size 16
0 s0 V1.8 V345.9 nV1.8 V
225 ps900 mV1.867 V1.338 mV1.8 V
270.1 ps1.8 V900.2 mV-29.87 mV1.798 V
338.3 ps1.8 V25.94 mV899.7 mV1.848 V
402.3 ps1.8 V23.8 mV1.622 V900.3 mV
500 ps1.8 V4.412 mV1.777 V8.703 mV
1 ns1.8 V346 nV1.8 V345.8 nV
1.5 ns1.8 V345.9 nV1.8 V345.9 nV
2 ns0 V1.786 V16.99 mV1.255 V
2.5 ns0 V1.8 V351.2 nV1.8 V
3 ns0 V1.8 V345.9 nV1.8 V

Measured with ngspice 42 on SKY130, 1.8 V, 50 ps input edge. The run is the lab of this lesson.

Stage Delay Is g·h + p

G9.6 showed that gate delay grows in a straight line with the load. Logical effort writes that line without units: d = g·h + p.

LetterNameMeaning
helectrical effortload capacitance divided by the input capacitance of the gate: its fan-out
glogical efforthow much worse the gate is than an inverter at driving a load; 1 for an inverter
pparasitic delaythe delay of the gate with no load, from its own drains
τunit of delaythe slope of the inverter line: delay per unit of fan-out

The delay d is counted in units of τ. The product f = g·h is the stage effort.

TransientUnit Inverters, Each Driving Four Copies of ItselfThree nodes of a chain with fan-out 4. The middle stage is the one measured.
  • v(h4n1)
  • v(h4n2)
  • v(h4n3)
-0.5 V00.5 V1.0 V1.5 V2.0 VVoltage00.5 ns1.0 ns1.5 ns2.0 nsTimehalf of the supplyrise: 71.1 ps after the stage before-0.5 V00.5 V1.0 V1.5 V2.0 VVoltage00.5 ns1.0 ns1.5 ns2.0 nsTimehalf of the supplyrise: 71.1 ps after the stage before
  1. Time 170.1 psv(h4n1) = 900.3 mV · v(h4n2) = -29.07 mV · v(h4n3) = 1.799 V

    The first stage falls through 0.9 V.

  2. Time 241.2 psv(h4n1) = 27.16 mV · v(h4n2) = 899.7 mV · v(h4n3) = 1.845 V

    The second stage rises through 0.9 V 71.1 ps later. This is the fan-out-of-4 delay for a rising output.

  3. Time 309.4 psv(h4n1) = 7.057 mV · v(h4n2) = 1.625 V · v(h4n3) = 900 mV

    The third stage falls 68.2 ps after that. Its load is the same four gates, with nothing behind them.

Read the plot as a table
Timev(h4n1)v(h4n2)v(h4n3)
0 s1.8 V345.9 nV1.8 V
170.1 ps900.3 mV-29.07 mV1.799 V
241.2 ps27.16 mV899.7 mV1.845 V
309.4 ps7.057 mV1.625 V900 mV
500 ps24.09 µV1.8 V29.9 µV
1 ns345.8 nV1.8 V346.6 nV
1.5 ns1.8 V48.1 µV1.8 V
2 ns1.8 V345.9 nV1.8 V

Measured with ngspice 42 on SKY130, 1.8 V. The same run holds the chains with fan-out 1, 2, 3 and 6.

Fan-out hInverterNAND2NOR2
124.6 ps33.7 ps41.4 ps
239.4 ps51.3 ps63.8 ps
354.4 ps69.6 ps86.7 ps
469.5 ps88.0 ps109.9 ps
699.9 ps125.2 ps156.7 ps

Measured: the mean of rise and fall of the middle stage. Each gate drives h copies of itself.

The inverter column is a straight line: 15.1 ps for each unit of fan-out, plus 9.4 ps. So τ is 15.1 ps in this process. The delay at a fan-out of 4, the FO4 delay, is 69.5 ps.

Logical Effort Compares a Gate with an Inverter

Size a gate so that it drives as well as the unit inverter. Then compare input capacitances. The ratio is the logical effort g.

Gate, sized for unit driveWidths at one inputInput capacitanceg in the modelp in the model
InverterNMOS 1, PMOS 23 units11
NAND2NMOS 2 (series), PMOS 24 units4/32
NOR2NMOS 1, PMOS 4 (series)5 units5/32

The model assumes a PMOS needs twice the width of an NMOS, and that capacitance follows width.

The model gives the NOR a larger g than the NAND. It needs wide PMOS in series, so each input sees more capacitance for the same drive.

GateSlope of the measured lineg = slope / τp = offset / τ
Inverter15.1 ps per unit1.000.62
NAND218.3 ps per unit1.220.99
NOR223.1 ps per unit1.531.18

Fitted to the measured table above (least squares over the five fan-outs). Every drain and source has the junction of a contacted diffusion, 0.29 µm long.

The measured efforts keep the order of the model: inverter, NAND, NOR. The values differ. The NAND measures 1.22 against 4/3, and the inverter's parasitic delay is 0.62 τ, under the model's 1. These netlists give every transistor the drain junction of a laid-out cell; without it the inverter's p falls to about 0.4. Use the model to choose sizes, and a simulator for the final delay.

Path Effort and Equal Stage Effort

A path is a chain of stages between a fixed input capacitance and a fixed load. Three numbers describe it.

What Multiplies Along a PathAn inverter, a NAND2 whose output also feeds two side branches, and an inverter into the load.
  • Datapath
  • Load
  • Data
What multiplies along a pathAn inverter, a NAND2 whose output also feeds two side branches, and an inverter into the load. datapath Inverter g = 1 datapath NAND2 g = 4/3 datapath Inverter g = 1 load Load 16 times the pathinput load Two side branches copies of the lastinverter on the pathoff the path
  1. datapath Inverterg = 1
    • NAND2
  2. datapath NAND2g = 4/3
    • on the path → Inverter
    • off the path → Two side branches
  3. datapath Inverterg = 1
    • Load
  4. load Two side branchescopies of the last inverter
  5. load Load16 times the path input
  1. G: multiply the logical efforts

    G = 1 × 4/3 × 1 = 4/3.

  2. B: multiply the branching efforts

    The NAND drives three equal gates and one is on the path. Its branching effort is 3. So B = 3.

  3. H: load over input

    H = 16.

  4. F = G·B·H

    F = 4/3 × 3 × 16 = 64. With three stages the best stage effort is the cube root: 4.

Read the diagram as text
  • Inverter: g = 1
  • NAND2: g = 4/3
  • Inverter: g = 1
  • Load: 16 times the path input
  • Two side branches: copies of the last inverter
  • Inverter → NAND2
  • NAND2 → Inverter: on the path
  • NAND2 → Two side branches: off the path
  • Inverter → Load

The path delay is least when every stage carries the same effort f = F^(1/N).

The least delay is N·f + P, where P is the sum of the parasitic delays. Here that is 3 × 4 + 4 = 16 τ.

The sizes follow from the load backwards. Each stage needs an input capacitance of g × b × (the capacitance it drives on the path) / f.

Size the Path With the Branch
A path of 3 gates driving a load of 16Cin 1Stage 1: Inverter, input capacitance 1, stage delay 2d1 = 2InverterC = 1Stage 2: NAND2, input capacitance 1, stage delay 6d2 = 6NAND2C = 1b = 3Stage 3: Inverter, input capacitance 1, stage delay 17d3 = 17InverterC = 1load 16
  1. 1 · InverterC = 1, d = 2, b = 1
  2. 2 · NAND2C = 1, d = 6, b = 3
  3. 3 · InverterC = 1, d = 17, b = 1
  4. ↓ Load 16

Capacitance is in units of a unit inverter's input; delay is in τ, with a PMOS twice the NMOS width and p = 1 for an inverter. A taller symbol is a larger gate.

Solid bar: effort delay g·h. Pale bar: parasitic delay p. The tick on each row marks that stage at the optimum.

The stage efforts differ (from 1 to 16). Equal efforts of 4 give the best delay.

Path effort F = GBH
64
G 1.33 · B 3 · H 16
Best stage effort
4
F^(1/3)
Delay D
25
9 above the best
Best for these stages
16
N·f + P = 3·4 + 4
Best stage count
3
D = 16, this path
Each stage: d = g·h + p, with h = b·C(next) / C(in)
StageGategpbC inhg·hd
1Inverter1111112
2NAND24/3231346
3Inverter1111161617

  1. Step 1. Every gate at unit size. The last inverter carries the whole load, and the path takes 25.0 τ.
  2. Step 2. Sized for equal stage effort: both later stages get an input capacitance of 4. The path takes 16 τ.

Drag a size and watch the stage efforts. The delay is least when the three bars are equal.

The Best Number of Stages

For a large F, more stages can be faster. Each added inverter lowers the effort per stage but adds its own parasitic delay. The best stage effort is close to 4.

How Many Inverters for a Load of 64?
A path of 1 gate driving a load of 64Cin 1Stage 1: Inverter, input capacitance 1, stage delay 65d1 = 65InverterC = 1load 64
  1. 1 · InverterC = 1, d = 65, b = 1
  2. ↓ Load 64

Capacitance is in units of a unit inverter's input; delay is in τ, with a PMOS twice the NMOS width and p = 1 for an inverter. A taller symbol is a larger gate.

Solid bar: effort delay g·h. Pale bar: parasitic delay p. The tick on each row marks that stage at the optimum.

Every stage bears the same effort, so no resizing can lower D.

Path effort F = GBH
64
G 1 · B 1 · H 64
Best stage effort
64
F^(1/1)
Delay D
65
at the optimum
Best for these stages
65
N·f + P = 1·64 + 1
Best stage count
3
D = 15
Each stage: d = g·h + p, with h = b·C(next) / C(in)
StageGategpbC inhg·hd
1Inverter1111646465

  1. Step 1. One inverter: its stage effort is 64 and the delay is 65 τ. Add inverters and press Best sizes after each.

The model's best count is 3 stages: 15 τ at a stage effort of 4. An odd change of the count inverts the output.

StagesSizesMeasured into 64 unit invertersModel
11583.4 ps65.0 τ
21, 8207.9 ps18.0 τ
31, 4, 16185.9 ps15.0 τ
41, 3, 8, 23194.6 ps15.3 τ
51, 2, 5, 12, 28211.8 ps16.5 τ

Measured: mean of both input edges, 50 ps edge at the first stage. Model: equal stage effort with p = 1 per inverter.

Measurement and model agree on the winner: three stages. They also agree that the curve is flat near the best count. Four stages cost only 8.7 ps more than three.

Sizing matters as much as the count. Three unit inverters in a row, with no growth, need 634.4 ps for the same load.

Asked in interviews
  1. What is logical effort?

    A way to write gate delay as d = g·h + p, in units of τ. The letter h is the fan-out. The effort g says how much input capacitance the gate needs for the drive of an inverter. The parasitic delay p is its delay with no load. It lets you size a path by hand.

  2. How do you size a path for the least delay?

    Compute F = G·B·H. With N stages, give every stage the effort f = F^(1/N). Work back from the load: each input capacitance is g times b times the capacitance it drives, divided by f.

  3. Why is a fan-out of about 4 used for buffer chains?

    The delay of a chain is N·f + N·p. A small f needs many stages and a large f makes each stage slow. The sum is least for f between 3 and 4, and it changes little nearby.

Try It

d_up is the delay from the rising input to the last stage: 177.3 ps. d_down is the same for the falling input: 194.5 ps. Their mean is 185.9 ps.

Change the three m= values of stages B2 and B3 to 1 and run: three unit inverters need 634.4 ps. The last one drives all 64 loads alone.

Delete stages B2 and B3 and connect the load to n1. Change both n3 in the meas lines to n1. One inverter needs 583.4 ps.

SPICEngspice 42 · simulator service
Edit the netlist, then run it
Expected measurements: d_up = 1.773366e-10 targ= 4.023366e-10 trig= 2.250000e-10 d_down = 1.945235e-10 targ= 1.969523e-09 trig= 1.775000e-09 t_in = 2.250000e-10 t_end = 4.023366e-10 t_n1 = 2.701265e-10 t_n2 = 3.382561e-10

Check Yourself

Predict the outputA chain of inverters drives a load 256 times its input. Each stage is 4 times the one before. Predict the exact line: the number of stages, then the delay in τ with p = 1.
module tb;
  int n = 0;
  initial begin
    // each stage is 4 times the one before it, until the load of 256 is reached
    for (int load = 256; load > 1; load = load / 4) n++;
    $display("%0d %0d", n, n * 4 + n);    // stages, then delay in tau with p = 1
  end
endmodule
ConceptIn d = g·h + p, what is h?
ConceptA path has G = 2 and a load 8 times its input. One stage feeds four equal gates, and one of them is on the path. What is F?
ConceptA path has F = 125 and three stages. Which stage effort gives the least delay?
ConceptFive inverters were tried in place of three for the load of 64. What did the measurement show?

Common Mistakes

Wrong Drive a large load with one very large gate.

The large gate is itself a large load for the gate before it. One unit inverter into 64 took 583.4 ps here. Three stages took 185.9 ps.

Fix Grow the size step by step, by a factor of about 4 per stage.

Wrong Use the logical effort of a NAND for a NOR: 4/3.

A NOR has its PMOS in series, so they must be twice as wide again. Its input capacitance is 5 units against 3 for the inverter.

Fix In the model, a two-input NAND has g = 4/3 and a two-input NOR has g = 5/3.

Wrong Leave the branching effort out of F.

A stage that also feeds side branches must charge them too. Its real load is b times the load on the path.

Fix Multiply by b at every stage whose output splits: F = G·B·H.

Wrong Add stages until each one has the smallest possible effort.

Every stage adds its own parasitic delay. Five stages took 211.8 ps here, more than three.

Fix Aim for a stage effort near 4. The stage count that gets closest wins.

Remember

  • Stage delay in units of τ: d = g·h + p.
  • Model values: inverter g = 1; NAND2 g = 4/3; NOR2 g = 5/3.
  • Path effort F = G·B·H. Include the branching effort wherever an output splits.
  • Least delay: every stage has the same effort f = F^(1/N). Size backwards from the load.
  • The best stage effort is near 4: one stage per factor of 4 in F.

Practice

Report a problem with this page