6.1Propagation delay and the critical path
The idea
The propagation delay of a gate is the time for its output to react to its input. In a circuit, the critical path is the slowest route from an input to the output; its total delay is the delay of the circuit.
Think of it like this: The slowest runner of a relay team decides the finish time.
Why it exists
GATE asks for the delay of a circuit or what limits the clock speed of a combinational block.
How it works
- List all the paths from the inputs to the output.
- Add the gate delays along each path.
- The largest sum is the critical path, the smallest is the shortest path (used for hold).
- Speeding up the critical path (look-ahead, restructuring) is what makes the whole circuit faster.
Worked example: Paths of 9 ns and 8 ns
The circuit delay is 9 ns. Speeding up the 8 ns path does not help at all.
Now play with it
- →Change the gate delays and see which path becomes critical.
- →Note how the shortest path differs from the critical path.
Add up the gates along each route from the inputs to the output. The slowest route sets the delay of the circuit.
Check yourself
The path delays in a combinational circuit are 8 ns, 12 ns and 5 ns. The propagation delay of the circuit is
Exam notes (the dense version)
Propagation delay t_pd is the time from an input change to the output change. The critical path is the slowest path between two registers (or input and output); its delay sets the speed. Add up the delays of the gates along each path (an output that feeds several paths counts on each); the contamination delay t_cd is the shortest path, used for hold checks. A gate in a chain counts once even if its output also feeds other gates. Reducing the critical path (more parallel logic, look-ahead) is how a circuit is made faster.