G9.7.2 Logical Effort by Hand

MediumImplementIcarus · browser samples / server checksReview the topic

Compute the path effort, the least delay and two gate sizes of a three-stage path with a branch.

Hardware context: A buffer chain that carries a clock enable from one small gate to 64 flip-flop inputs. Work out the path effort and the gate sizes of a decoder path with a branch.

A decoder path runs through a NAND2, a NOR2 and an inverter to a large load. The NOR2 also feeds two other inverters. You want its least delay and the sizes that give it, before any simulation.

This is an Implement problem. Use the logical-effort model with the values in the header. Work out the path effort F and the least delay D. Then size the NOR2 and the last inverter for equal stage effort.

Write each result as a whole number in its assign line of the module answer. Give D in tenths of τ. The check reads each output and reports the first one that is wrong.

Signals in the Timeline

SignalWidthRole
item8input of each check
Full specification
The path. Capacitances are in units of one unit inverter's input
in (4 units) --> NAND2 --> NOR2 --+--> inverter --> load (48 units)
                                    |
                                    +--> inverter  (off the path)
                                    +--> inverter  (off the path)
           the three inverters are the same size
OutputMeaningRounding
path_fpath effort F = G · B · Hnearest whole number
d10least path delay N · F^(1/N) + P, times 10nearest whole number
c_norinput capacitance of the NOR2 at equal stage effortnearest whole unit
c_invinput capacitance of the last inverter at equal stage effortnearest whole unit
Worked example: two inverters, input 1, load 16Value
G, B, H1, 1, 16
F16 (example_f)
stage effort fthe square root of 16 = 4
D = 2 · f + P2 × 4 + 2 = 10 τ, so example_d10 = 100
second inverter16 / 4 = 4 units (example_c2)

Examples

Example 1

Worked Example: Path Effort
Input
two inverters, input 1 unit, load 16 units
Output
example_f = 16

Two inverters have G = 1 and no branch. H is 16, so F is 16.

Example 2

Worked Example: Least Delay
Input
two inverters, input 1 unit, load 16 units
Output
example_d10 = 100

Two stages share F = 16, so each has f = 4. P is 1 + 1. D = 2 × 4 + 2 = 10 τ, written as 100.

Example 3

Worked Example: The Size of the Second Inverter
Input
two inverters, input 1 unit, load 16 units
Output
example_c2 = 4

Work back from the load: the second inverter needs g × 16 / f = 16 / 4 = 4 units. Each stage then has a fan-out of 4.

Constraints and Contract

  • Keep the module name answer and the names of its outputs.
  • Every output is a whole number, rounded as the table says.

Hints

Hint 1

G is the product of the three logical efforts. B is the product of the branching efforts. H is the load over the input.

Hint 2

The NOR2 drives three equal inverters, and one of them is on the path. Its branching effort is 3.

Hint 3

Size backwards. The last inverter needs g × 48 / f. The NOR2 needs g × b × (the inverter size) / f.

What the grader checks: The check reads seven outputs and compares each with the value that assets/v3/effort-core.mjs computes, the code of the effort widget. Three of them are the worked example. The model values of g and p are the textbook ones. Lesson G9.7 shows how SKY130 differs.

7 checks on Icarus · browser samples / server checks. Run the examples first, then check the full regression. Full checks use the server judge. Downloads contain public samples only. A passing result establishes the tested cases, not a proof for all possible inputs.

See all 2 steps and the final capstone

Report a problem with this page

Your code SystemVerilogSaved locally
Ln 1, Col 1Tab indents · Ctrl/⌘ + Enter runs samples
Not run yet

Worked Example: Path Effort

Input
two inverters, input 1 unit, load 16 units
Expected output
example_f = 16

Two inverters have G = 1 and no branch. H is 16, so F is 16.

Run samples executes all 3 public checks. Check all tests runs 7 checks on the server.

Icarus · browser samples / server checks