JK and T flip-flops

WHY do we need JK at all?

WHAT is wrong? When $S=R=1$, we ask the circuit to make $Q=1$ AND $Q=0$ simultaneously. In a real gate this produces a race and an unpredictable output. That single wasted row is a design sin.

HOW does JK fix it? JK renames $S\to J$, $R\to K$, and reroutes the $J=K=1$ case to mean "toggle" ($Q_{next}=\overline{Q}$). Nothing else changes.

Deriving the JK from first principles

Build JK from SR by making the internal set/reset depend on the current state: $S = J\cdot \overline{Q}, \qquad R = K\cdot Q$

Why this step? $S=J\overline Q$ means "only try to set when we are currently $0$" ($\overline Q=1$). $R=KQ$ means "only try to reset when we are currently $1$". Because $Q$ and $\overline Q$ can never both be 1, the internal $S$ and $R$ can never both be 1 — the forbidden combination is now structurally impossible. That is the whole magic.

Now plug into the SR characteristic equation. First derive SR's: $Q_{next} = S + \overline{R}\,Q$

Why? $S=1$ forces $Q_{next}=1$. Otherwise ($S=0$) we keep $Q$ unless $R=1$ resets it — hence $\overline R Q$.

Substitute $S=J\overline Q$, $R=KQ$: $Q_{next} = J\overline Q + \overline{(KQ)}\,Q$

Simplify $\overline{KQ}\cdot Q = (\overline K + \overline Q)Q = \overline K Q + \overline Q Q = \overline K Q + 0 = \overline K Q$.

Why this step? $\overline{KQ}=\overline K+\overline Q$ (De Morgan), and $\overline Q Q=0$. So:

Check the four rows against the boxed formula to convince yourself — that is the point of deriving it.

The T flip-flop = JK with $J=K=T$

Derive its characteristic equation by putting $J=K=T$ into the JK equation: $Q_{next} = T\overline Q + \overline T Q$

Why this step? That expression is exactly the definition of XOR.

WHY it matters: a chain of T flip-flops (each fed the previous one's output) is a ripple counter — each stage toggles at half the rate of the one before, giving frequency division by 2, 4, 8, …

Excitation tables (for designing circuits)

Characteristic tables answer "given inputs, what's the output?". Excitation tables answer the reverse — "I want this transition, what inputs do I need?" — which is what you actually use when building counters.

Why the don't-cares in JK? To go $0\to1$ we need to set, so $J=1$; but $K$ is irrelevant because $K$ only acts when $Q=1$. That freedom (X) is what makes JK cheaper to implement in K-maps.

Worked examples

Common mistakes

Flashcards

Connections

• SR Flip-Flop — the parent JK is derived from
• D Flip-Flop — the other "no forbidden state" fix ($Q_{next}=D$)
• Edge-Triggering and Master-Slave — why JK doesn't race
• Ripple Counters — built from cascaded T flip-flops
• Excitation Tables and Sequential Design
• Karnaugh Maps — where JK's don't-cares reduce logic
• XOR Gate — the heart of the T flip-flop

Concept Map

Hinglish (regional understanding)