3.1.15 · D4Boolean Algebra & Logic Gates

Exercises — Logic gate propagation delay

2,508 words11 min readBack to topic

The tools we lean on: the charging law , the core delay result , and the rule that delays add along a path. See also RC circuits and time constant, Fan-out and loading, Critical path and clock frequency, and Static and dynamic hazards.


Level 1 — Recognition

L1·Q1

Which reference points on the input and output waveforms are used to define propagation delay?

Recall Solution

The 50% voltage level of the input to the 50% voltage level of the output. Why 50%? The logic threshold — the voltage the next gate uses to decide 0 vs 1 — sits about halfway up the swing, so 50% is a consistent, technology-independent marker.

L1·Q2

A gate's output goes from Low to High in response to an input change. Which delay symbol is this, or ?

Recall Solution

— the letters name the output transition: Low → High.

L1·Q3

True or false: a truth table tells you when the output settles.

Recall Solution

False. A truth table is timeless — it only states what the steady-state output is, never when it arrives. Timing is a separate layer, given by .


Level 2 — Application

L2·Q1

A CMOS inverter has pull-down resistance and load . Find its time constant and its .

Recall Solution

Step 1 — the time scale. . Why? sets the whole clock of the exponential charge/discharge. Step 2 — the 50% crossing. . Why? Delay is the time to reach , which costs a factor .

L2·Q2

A driver has . It must charge within . Does it meet the budget?

Recall Solution

Step 1. . Step 2. , so it fails the budget by . Why? The required delay is smaller than the delivered delay; the driver is too slow for this load.

L2·Q3

Fan-out doubles: a gate that drove now drives (nothing else changes). By what factor does its delay change, and why?

Recall Solution

Step 1. is linear in . Step 2. Doubling doubles — factor . Why? Twice the charge must be pushed through the same resistance, so it takes twice as long to reach the halfway voltage. See Fan-out and loading.


Level 3 — Analysis

L3·Q1

A signal passes through three gates on one path: XOR () → NAND () → INV (). Find the total path delay and the maximum clock frequency if this is the critical path.

Recall Solution

Step 1 — delays add. . Why? Each gate cannot begin responding until its input (the previous gate's output) has settled; the waits stack up in series. Step 2 — frequency limit. . Why? A fresh input can't be launched faster than the output settles. See Critical path and clock frequency.

L3·Q2

A circuit has two paths from input to output: Path A = AND() → OR() → INV(), all in ns. Path B = NAND() → NAND(), in ns. Which path is critical, and what is ?

Figure — Logic gate propagation delay
Recall Solution

Step 1 — sum each path. Path A . Path B . Step 2 — pick the longest. The critical path is the slower one: Path B, . Why? The output is only guaranteed correct once every path has settled — the slowest one dominates. Step 3. .

L3·Q3

Compute where the inverter that produces has delay and the AND gate is ideal (0 delay). Let go at . Describe the output over time.

Figure — Logic gate propagation delay
Recall Solution

Step 1 — before the switch. For : , , so . ✓ Step 2 — just after the switch. At : now, but is still 1 because the inverter's output won't fall until have passed. Step 3 — the glitch. During : — a false 1 pulse of width . Step 4 — after settling. For : , so . ✓ Why? Unequal arrival times at the AND gate produce a momentary wrong output — a static-1 hazard. See Static and dynamic hazards.


Level 4 — Synthesis

L4·Q1

A driver must meet while driving . What is the maximum allowable pull-down resistance ?

Recall Solution

Step 1 — rearrange the core formula. . Step 2 — plug in. Why? Lower means faster; the largest that still meets the budget is the equality case.

L4·Q2

A chain of identical inverters, each with , must have total delay below . What is the maximum ?

Recall Solution

Step 1 — total delay. identical stages in series give . Step 2 — inequality. . Step 3 — integer. The largest integer below 8 is (; is not below 200). Why? "Below" is a strict inequality, so (exactly 200 ps) is excluded.

L4·Q3

Two design options for one driver stage:

  • Option A: , self input-capacitance .
  • Option B: , self input-capacitance (bigger transistor).

Each drives an external load . But the previous stage has and must charge this stage's input capacitance. Compare the total delay (previous stage delay + this stage delay) for both options.

Recall Solution

This stage drives only the external load (its own input cap is a load on the previous stage, not itself). Option A

  • This stage: .
  • Previous stage charging A's input (4 fF): .
  • Total . Option B
  • This stage: .
  • Previous stage charging B's input (8 fF): .
  • Total . Verdict: Option B is faster overall ( ps) — its lower more than pays for the extra input capacitance it imposes on the previous stage. Why? Sizing is a trade-off: you must count the delay you add upstream, not just the delay you save locally. See Fan-out and loading and CMOS transistor structure.

Level 5 — Mastery

L5·Q1

Derive the exact factor for a 10%–90% rise time from the charging law, and compare it to the propagation-delay factor. (Show that uses a different constant than .)

Recall Solution

Step 1 — the law. , so . Step 2 — time to 10%. . Step 3 — time to 90%. . Step 4 — rise time. Compare: rise time uses , propagation delay uses . They measure different things — edge sharpness vs 50% arrival — so of course the constants differ. This is exactly why you must never confuse them.

L5·Q2

Consider the degenerate/limiting cases of : (a) (no load at all), (b) (perfect switch), (c) (transistor barely conducts). What delay does each predict, and is it physical?

Recall Solution

(a) : . With nothing to charge, the output flips essentially instantly. Idealised limit — real gates always have some internal parasitic capacitance, so true delay never hits exactly zero. (b) : again — a perfect (zero-resistance) switch dumps charge onto instantly. Idealised — real transistors always have finite channel resistance. (c) : — a transistor that barely conducts takes forever to charge the load. This is the failure mode of an under-driven or "off" transistor: the output never reaches threshold in useful time. Why these matter: they confirm the formula behaves sensibly — delay vanishes when there is nothing to charge or no resistance, and blows up when conduction dies. See RC circuits and time constant.

L5·Q3

A gate's delay is specified as the average . A particular inverter has pull-up resistance and pull-down resistance , both driving the same . Find , , and the quoted average .

Recall Solution

Step 1 — Low→High uses the pull-up. Charging up to goes through : . Step 2 — High→Low uses the pull-down. Discharging to ground goes through : . Step 3 — average. Why the two differ: the rising and falling edges are driven by different transistors with different resistances, so the two delays are genuinely unequal. The single quoted number is their average. This asymmetry (a fatter pull-up because holes are slower carriers) traces back to CMOS transistor structure.


Active recall

Recall Rapid self-check
  • State the 50%→50% definition without looking. ::: Input crosses 50% of its swing to output crosses 50%, in response to that change.
  • in terms of and ? ::: .
  • Do parallel paths add or take the max? ::: Take the max (critical path); within one path they add.
  • Why is ? ::: Rise and fall use different transistors (pull-up vs pull-down) with different resistances.

Connections