Compute the Elmore delay of three nodes of an RC tree with two branches, in picoseconds.
Hardware context: A gate that drives two receivers through a branching wire, modelled as an RC tree. Estimate which receiver of a branching net switches last before running a timing tool.
A gate drives two receivers through a wire that splits. Before any tool runs, you want to know which receiver switches last. The Elmore delay gives that from the resistors and capacitors alone.
This is an Implement problem. The specification shows the tree. Work out the Elmore delay of the branch point b and of the two sinks x and y. Then give the 50 % estimate at sink x.
Write each result as a whole number of picoseconds in its assign line of the module answer. The check reads each output and reports the first one that is wrong.
Signals in the Timeline
| Signal | Width | Role |
|---|---|---|
item | 8 | input of each check |
Full specification
source --R1 2 kΩ-- a --R2 1 kΩ-- b --R3 3 kΩ-- x
| | |
4 fF 6 fF 5 fF
|
+--R4 1 kΩ-- y
|
10 fF
| Output | Meaning | Unit |
|---|---|---|
| t_b | Elmore delay from the source to the branch point b | ps |
| t_x | Elmore delay from the source to sink x | ps |
| t_y | Elmore delay from the source to sink y | ps |
| half_x | 0.69 times t_x, rounded to the nearest whole number | ps |
| Worked example: a two-section line | Capacitor | Resistance in front of it | Product |
|---|---|---|---|
| far end (example_end) | first 10 fF | 1 kΩ | 10 ps |
| second 10 fF | 1 kΩ + 1 kΩ | 20 ps | |
| sum | 30 ps | ||
| middle node (example_mid) | first 10 fF | 1 kΩ | 10 ps |
| second 10 fF | 1 kΩ: only the shared resistor | 10 ps | |
| sum | 20 ps | ||
| lumped (example_lump) | all 20 fF | 2 kΩ | 40 ps |
A resistance in kΩ times a capacitance in fF gives a time in ps.
Examples
Example 1
Worked Example: The Far End of a Two-Section Line- Input
the two-section line: 1 kΩ, 10 fF, 1 kΩ, 10 fF
- Output
example_end = 30
The first capacitor is charged through 1 kΩ: 10 ps. The second is charged through both resistors: 20 ps. The Elmore delay of the far end is 30 ps.
Example 2
Worked Example: The Middle Node- Input
the two-section line: 1 kΩ, 10 fF, 1 kΩ, 10 fF
- Output
example_mid = 20
For the middle node only the first resistor is on the path. Both capacitors are charged through it: 10 ps + 10 ps = 20 ps. The second resistor is not counted.
Example 3
Worked Example: The Same Line Lumped- Input
the two-section line lumped: 2 kΩ into 20 fF
- Output
example_lump = 40
Put both resistors in front of both capacitors: 2 kΩ × 20 fF = 40 ps. That is 10 ps more than the Elmore delay of the far end. The first capacitor really sees only 1 kΩ.
Constraints and Contract
- Keep the module name answer and the names of its outputs.
- Every output is a whole number of picoseconds.
Hints
Hint 1
Take one capacitor at a time. Ask which resistors its charge must pass on the way from the source.
Hint 2
For a node of interest, count only the resistors that are also on the path to that node. For sink x, the capacitor at y is charged through R1, R2 and R4. Sink x shares R1 and R2 only.
Hint 3
Every one of the four capacitors appears in every sum. For b, the capacitors at x and y both count with R1 + R2 only.
What the grader checks: The check reads seven outputs and compares each with the value computed in JavaScript. Three of them are the worked example. Elmore delay is an estimate. Lesson G9.6 compares these sums with an ngspice run of the same tree. Input edges and transistor behaviour are outside this problem.
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 1 steps and the final capstone