Registers — N flip-flops storing N bits

WHAT is a register?

WHAT it stores: an $N$ -bit pattern, e.g. 1011 in a 4-bit register.
WHAT distinguishes it from raw flip-flops: the flip-flops are synchronised (same clock) so the bits don't change at slightly different times — the word stays consistent.

HOW: building it from one flip-flop

Step 1 — The atom: a D flip-flop

The defining behaviour (its characteristic equation):

$Q_{\text{next}} = D \quad \text{(captured at the clock edge)}$

Why this equation? "Next stored value = the data I presented." Between edges $Q$ is frozen, so it is genuinely memory, not just a wire.

Step 2 — Replicate N times

Put down flip-flops $FF_0, FF_1, \dots, FF_{N-1}$ . Wire:

data inputs $D_0 \dots D_{N-1}$ (the word you want to store),
a shared clock to every flip-flop,
outputs $Q_0 \dots Q_{N-1}$ (the stored word).

$Q_i^{\text{next}} = D_i \quad \text{for all } i = 0,1,\dots,N-1 \text{, at the same clock edge}$

Why share the clock? So the word updates atomically. If each bit had its own clock, you could read a half-old, half-new garbage value (a race). One clock = one consistent snapshot.

Figure — Registers — N flip-flops storing N bits

Step 3 — Add a Load (enable) line

A bare register would overwrite itself every clock edge. Usually you want it to hold until told to load.

$D_i = \text{LOAD}\cdot \text{IN}_i + \overline{\text{LOAD}}\cdot Q_i$

So the actual update rule of a loadable register is:

$\boxed{\,Q_i^{\text{next}} = \text{LOAD}\cdot \text{IN}_i + \overline{\text{LOAD}}\cdot Q_i\,}$

Why this works: it's just a 2-to-1 multiplexer selecting "new data" vs "old self." When LOAD is low, $Q_i^{\text{next}}=Q_i$ → the bit is unchanged → memory preserved.

Common mistakes

Recall Feynman: explain it to a 12-year-old

Imagine a row of light switches, each either ON or OFF — that's a bit. A flip-flop is one switch that stays where you flicked it. Put 8 switches in a row and agree "we all flip at the same drumbeat (the clock)" — now you can set an 8-bit pattern in one beat and it stays frozen until the next time you say "load." That row of switches is a register: the computer's tiny, super-fast scratch pad it keeps right next to its brain.

Flashcards

What is a register?

A group of N flip-flops sharing one clock, storing an N-bit word that updates atomically on the clock edge.

How many bits does one flip-flop store?

Exactly one bit (a 0 or a 1).

How many distinct values can an N-bit register hold?

2^N

patterns (range 0 to

2^N-1

unsigned).

Why share a single clock across all flip-flops?

So all bits latch simultaneously and the word updates atomically, avoiding half-updated garbage values.

What is the characteristic equation of a D flip-flop?

Q_{\text{next}} = D

, captured at the active clock edge.

What does the LOAD line do, and what is the update rule?

It selects new data vs. holding the old value:

Q_i^{next} = \text{LOAD}\cdot\text{IN}_i + \overline{\text{LOAD}}\cdot Q_i

What happens to a bare D-register (no LOAD) each clock edge?

It reloads its input every edge, so it does NOT hold a value if the input changes.

Why are registers the fastest storage in a CPU?

They store/read all bits in parallel hardware right beside the logic, with no addressing or looping overhead.

Largest unsigned value in an 8-bit register?

2^8 - 1 = 255

Does N bits mean N stored numbers?

No — it stores ONE number of width N bits; N is the width, not the count of values.

Connections

Flip-Flops — 1-bit memory — the building block.
D Flip-Flop and the Clock Edge — how a single bit latches.
Multiplexers — selecting between inputs — implements the LOAD line.
Binary Numbers and 2^N — why capacity is $2^N$ .
CPU Architecture — Register File — many registers grouped and addressed.
Clock and Synchronous Logic — why a shared timing signal matters.
Counters and Shift Registers — registers with feedback that move bits.

Concept Map

Hinglish (regional understanding)

Intuition Hinglish mein samjho

Socho ek single flip-flop ek chhota sa switch hai jo sirf ek bit (0 ya 1) yaad rakh sakta hai. Ab agar tumhe poora number, jaise 4-bit ka 1011, store karna hai, toh tum bas 4 flip-flops ek line mein rakh do. Yahi bundle hota hai ek register. Sabse important baat: in sabhi flip-flops ko ek hi clock par jodte hain, taaki saare bits ek hi instant par, ek saath update ho. Isi parallel nature ki wajah se register CPU ki sabse fast memory hoti hai — koi looping nahi, koi addressing nahi.

D flip-flop ka rule simple hai: $Q_{next} = D$ , yaani clock edge par jo input wire pe tha, wahi freeze ho jaata hai. Isko N baar copy kar do toh har bit ke liye $Q_i^{next} = D_i$ . Lekin ek problem hai: bare register har clock edge pe naya input le leta hai, toh purani value ud jaayegi. Isiliye ek LOAD line lagate hain ek multiplexer ke saath: $Q_i^{next} = \text{LOAD}\cdot \text{IN}_i + \overline{\text{LOAD}}\cdot Q_i$ . Jab LOAD=0, register apni hi value wapas store kar leta hai — matlab "hold". Yaad rakho: "LOAD low = leave it alone."

Capacity ka funda: $N$ bits ke saath kitne alag-alag patterns ban sakte hain? Har bit 2 choices deta hai aur N independent bits hain, toh $2 \times 2 \times \dots = 2^N$ . Isliye 8-bit register $2^8 = 256$ values rakh sakta hai, range $0$ se $255$ . Dhyaan rakho — register ek time pe ek hi number rakhta hai, N alag numbers nahi; N toh sirf width hai. Yeh concept aage CPU ke register file, counters, aur shift registers samajhne ki neev hai.

Registers — N flip-flops storing N bits

WHAT is a register?

HOW: building it from one flip-flop

Step 1 — The atom: a D flip-flop

Step 2 — Replicate N times

Step 3 — Add a Load (enable) line

Worked examples

Common mistakes

Flashcards

Connections

Concept Map

Hinglish (regional understanding)

Test yourself — How Computers Work

Connections