3.4.3 · D1Sequential Circuits

Foundations — Edge-triggered D flip-flop

1,926 words9 min readBack to topic

Before you can trust the parent note's line " at the active clock edge", you have to already own about a dozen little ideas. The parent quietly assumed them. This page builds each one from nothing, in an order where every new idea only leans on ideas already introduced.


0. A wire carries one of two values

Figure — Edge-triggered D flip-flop

Why the topic needs it: the whole flip-flop stores one bit — one of these two values. Its input , its clock , and its output are all just wires holding a or a . If "1 and 0 on a wire over time" is not crystal clear, nothing else can be.


1. A gate turns input levels into an output level

So read aloud is "NOT (A or B)" — that is exactly the NOR gate.

Figure — Edge-triggered D flip-flop

Why the topic needs it: the flip-flop is built entirely out of NOR (and later AND/NOT) gates. The parent writes — that is three of these symbols stacked. You cannot read it without owning the bar, the plus, and the NOR rule.


2. Truth tables — listing every possible case

(OR) (AND) (NOR)
0 0 0 0 1
0 1 1 0 0
1 0 1 0 0
1 1 1 1 0

Why the topic needs it: every claim like " hold" is one row of a truth table. Reading the parent = reading tables.


3. Feedback — a wire that loops back on itself

Figure — Edge-triggered D flip-flop

Why the topic needs it: the SR latch — the beating heart of the flip-flop — is exactly two NOR gates wired in a feedback loop. The parent's line "Memory is just a stable loop" is this idea. Without feedback there is no storage, and the entire chapter collapses.


4. Present state vs. next state — the subscripts and

Why the topic needs it: the parent's central equation only makes sense once you know means "the value after the edge". Miss the subscript and you'll think the output changes continuously — it doesn't.


5. The clock — a signal that ticks

Figure — Edge-triggered D flip-flop

Why the topic needs it: "edge-triggered D flip-flop" is a clock idea. Positive-edge, active edge, keep-out window — all of it needs you to distinguish level from edge first.


6. Time (a horizontal axis) and propagation delay

Why the topic needs it: setup time, hold time, clock-to-Q, and are all statements about when signals become valid. Time-on-the-x-axis and "changes cost delay" are the prerequisites for the whole timing section.


The prerequisite map

Binary signal 0 or 1 on a wire

Logic gates NOT NOR

Clock ticking signal

Truth tables all cases

Feedback loop

Bistable memory SR latch

Time axis and delay

Level vs Edge

State Qn and Qnext

Edge triggered D flip-flop

Read it bottom-up: bits on wires → gates → (tables + feedback) → bistable memory → add a clock and its edges + the notion of present/next state + timing → the parent topic.


Equipment checklist

Test yourself; each line hides its answer.

What are the only two values a digital wire can hold?
Logic (high) and logic (low) — nothing in between.
In logic, what does the bar do?
Flips the bit: , (the NOT operation).
In logic, what does mean, and what is ?
means OR; (true or true is still true).
In logic, what does mean?
AND — output is only if both inputs are .
State the NOR rule in words.
Output is only when all inputs are ; otherwise .
Why does a truth table capture every case?
With inputs it lists all combinations, so none can be missed.
What does feedback (a looped-back output) make possible?
Memory — a stable loop that holds its last value (a bistable).
What do and mean?
= present stored value; = value right after the next active edge.
Difference between a clock level and a clock edge?
A level is a stretch of time sitting high or low; an edge is the instant of transition ( or ).
What is a rising (positive) edge?
The moment the clock goes .
Why is 's budget an addition of delays?
The delays (, , ) happen one after another along one data path, so they sum.

Connections