Foundations — D latch and gated latches

This page assumes you have seen nothing. Before we can read $Q_{\text{next}} = E\,D + \overline{E}\,Q$ on the parent note, we must earn every single symbol in it. We go one brick at a time.

1. A bit — the smallest thing there is

Plain words: a bit is a yes/no. Nothing in between — no $0.5$, no "maybe".

The picture: a light switch. Down = $0$ (off), up = $1$ (on). There is no half-pressed switch.

Why the topic needs it: a latch's whole job is to store one bit. If you don't know what a bit is, "storing one" means nothing.

2. A wire and a signal — how a bit travels

The picture: a water pipe. Water flowing = signal $1$ (high); no water = signal $0$ (low). The pipe (wire) is always there; what changes is whether it's carrying a $1$ or a $0$.

Why the topic needs it: the latch has several wires — $D$, $E$, $Q$. Each carries one bit. When we say "$E=1$" we mean "the enable wire is currently high".

3. Naming wires with letters — $D$, $E$, $Q$

Plain words: $D$, $E$, $Q$ are just nicknames for wires, the way $x$ is a nickname for a number in algebra. Writing $D=1$ means "the wire we nicknamed $D$ is high right now."

The picture: a whiteboard with a sliding cover.

• $D$ = the marker you press against the board.
• $E$ = the cover: open ($E=1$) lets you write; closed ($E=0$) protects what's there.
• $Q$ = whatever is currently visible on the board.

Why the topic needs it: these three letters are the entire cast of characters. Every equation on the parent page is a story about how $Q$ reacts to $D$ and $E$.

4. The overline — $\overline{D}$, the "opposite" (NOT)

Plain words: the overline is the word "not". $\overline{D}$ = "not $D$".

The picture: a see-saw. Push one side down (that's $D=1$) and the other side ($\overline{D}$) goes up to $0$. They are always opposite — they can never both be up.

Why the tool and not another? We specifically need something that guarantees two wires are always opposite. The overline is exactly that guarantee. The parent uses it to set $R=\overline{D}$ so that $S=D$ and $R$ can never both be 1 — that is the trick that kills the SR latch's forbidden state. No other operation gives you "always opposite" so cheaply.

5. The dot — $E\cdot D$, the "both" gate (AND)

Plain words: the dot is the word "and". "$E$ AND $D$".

The picture: two doors in a hallway, one after the other. You get through ($=1$) only if both are open. If either is shut, you're stopped ($=0$).

Why the tool and not another? The parent builds the gated latch by feeding the SR latch $S^{\prime }=S\cdot E$. Read it: the set signal only reaches the latch when $E$ is also 1. AND is the perfect "permission gate" — it lets a signal pass only with permission from the enable. That is literally what "gated" means.

6. The plus — $ED+\overline{E}Q$, the "either" gate (OR)

Plain words: the plus is the word "or". Careful — this is not ordinary addition. In boolean algebra $1+1=1$, not $2$, because "at least one is on" is still just "on".

The picture: two doors side-by-side into the same room. You reach the room ($=1$) if either door is open.

Why the tool and not another? The characteristic equation has two situations — "enabled, so take $D$" and "not enabled, so keep old $Q$". Exactly one of them is ever active (because $E$ and $\overline{E}$ are opposites). OR glues the two branches into a single formula: whichever branch is "on" wins, and they never fight.

7. Two special outputs — $Q$ and $\overline{Q}$

The picture: the see-saw again — if $Q$ is up, $\overline{Q}$ is down. The SR latch's forbidden state is the impossible moment when someone tries to push both ends up at once — the see-saw jams. That jam is exactly what the D latch is designed to prevent.

Why the topic needs it: understanding why $Q=\overline{Q}$ is a contradiction is the whole motivation for the D latch. See SR Latch and NOR and NAND Gates for how cross-coupling produces this pair.

8. "Old value" vs "new value" — $Q_{\text{prev}}$ and $Q_{\text{next}}$

Plain words: memory only makes sense across time. The equation asks: given what you're storing now and the inputs, what will you store next?

The picture: a film strip. Each frame is one moment. $Q_{\text{prev}}$ is the previous frame; $Q_{\text{next}}$ is the frame we are about to draw.

Why the tool and not another? Without a "before/after" split, an equation like $Q=ED+\overline{E}Q$ would read as "$Q$ equals something containing $Q$" — a circular sentence. Splitting it into $Q_{\text{next}}$ and $Q_{\text{prev}}$ turns a puzzle into a clear recipe: new = f(inputs, old).

9. Feedback — how a wire remembers itself

The picture: a snake gently biting its own tail — the value keeps circling around, unchanged, until something outside forces a new value in.

Why the topic needs it: the $\overline{E}Q$ term is the feedback. When $E=0$, that term hands the old $Q$ straight back to become the new $Q$. Remove the loop and the latch forgets everything the instant you stop driving it. This is the seed idea behind Registers and the D Flip-Flop.

10. Putting the symbols back together

Now read the parent's boxed line with fully-earned eyes:

$Q_{\text{next}}=\underset{\text{enabled}\to \text{take }D}{\underbrace{ED}}+\underset{\text{not enabled}\to \text{keep old }Q}{\underbrace{\overline{E}Q}}$

• $ED$: "$E$ AND $D$" — nonzero only when enabled and the data is $1$.
• $\overline{E}Q$: "(NOT $E$) AND old $Q$" — active only when disabled, and it just returns the stored bit (feedback).
• $+$: "OR" — glue the two mutually-exclusive branches into one answer.

Because $E$ and $\overline{E}$ are always opposite, exactly one term is ever live. That is the same select-one-of-two logic used by a 2:1 multiplexer, which is why the parent calls the D latch "a MUX with feedback."

Prerequisite map

Equipment checklist

Hide the right side and test yourself. If any answer is fuzzy, re-read that section before the parent note.