3.4.3 · HinglishSequential Circuits

Edge-triggered D flip-flop

1,757 words8 min readRead in English

3.4.3 · Hardware › Sequential Circuits


YEH HAI KYA?

Subscript matter karta hai: woh state hai jo edge ke baad hogi, se compute ki gayi jo edge par sample ki gayi.


EDGE KI ZAROORAT KYU HAI?


KAISE BANTA HAI? (Scratch se derivation)

Hum ise teen layers mein banate hain, har ek pichli ki flaw solve karta hai.

Layer 1 — SR latch (feedback = memory)

Do NOR gates cross-couple karo:

  • (Set)
  • (Reset)
  • hold (feedback last value rakhta hai) → yahi memory hai.
  • forbidden.

Layer 2 — Gated D latch (forbidden state hatao)

aur ko opposites banao aur unhe Enable se gate karo: Jab : (transparent). Jab : → hold. Forbidden state kabhi nahi aa sakti kyunki complementary hain. Lekin yeh abhi bhi level-triggered hai.

Layer 3 — Master–slave = edge behaviour

Do D latches ko opposite enables ke saath chain karo:

  • Master latch se enable hota hai
  • Slave latch se enable hota hai

Rising edge trace karo:

  1. Jab : master transparent hai ( track karta hai), slave band hai (purana hold karta hai).
  2. Rising edge par: master us value ko freeze kar leta hai jo edge se just pehle thi; slave khulta hai aur us frozen value ko mein copy karta hai.
  3. Jab : master band (naye ko ignore karta hai), slave transparent hai lekin uska input (master output) frozen hai → stable.

Result: ek baar, edge par, change hota hai, woh jo bhi edge se just pehle tha. Yahi exactly edge-triggering hai. 🎉

Figure — Edge-triggered D flip-flop

Timing: woh numbers jo ise real banate hain


Worked examples


Flashcards

Edge-triggered aur level-triggered storage mein kya farq hai?
Edge-triggered (flip-flop) output sirf clock edge par update karta hai; level-triggered (latch) poore clock level ke liye transparent hota hai.
D flip-flop ki characteristic equation
(next state = sampled input, se independent).
Do latches ko opposite enables ke saath kyun chain karte hain (master–slave)?
Taaki ek waqt mein exactly ek hi khula ho; value edge par freeze ho jaaye, edge-triggered (non-transparent) behaviour milta hai.
Setup time define karo.
Minimum time jitna D ko active clock edge se pehle stable rehna chahiye taaki reliably capture ho sake.
Hold time define karo.
Minimum time jitna D ko edge ke baad stable rehna chahiye.
Metastability kya hai?
Ek unstable state jahan Q 0 aur 1 ke beech hover karta hai, setup/hold violate karne se hota hai; unpredictable delay ke baad resolve hota hai.
FF→logic→FF path ke liye max clock frequency ka formula
.
D flip-flop ko toggle (÷2) kaise banate hain?
ko se connect karo; har edge Q ko invert karta hai.
Edge-triggering safe shift registers kyun enable karta hai?
Edge input ko almost instantly band kar deta hai, isliye data clock ki jagah ek stage per clock hop karta hai, race nahi karta.
Positive-edge FF kaunse clock event se trigger hota hai?
Clock ki rising (0→1) transition se.

Recall Feynman: 12-saal ke bachche ko samjhao

Ek mailbox imagine karo jisme ek flap hai jo snap shut hoti hai. Ek postman (clock) har tick mein ek baar guzarta hai. Jis exact moment woh guzarta hai, jo bhi letter (D) tumhare haath mein hai woh box mein chali jaati hai — aur flap slam ho jaati hai. Baaki time box locked rehta hai: tum koi bhi letter hilaate raho, kuch nahi badalta. Jab postman phir aata hai, box teri nayi letter se swap ho jaata hai. Woh "guzarne ke moment par snap" hi edge hai. Isliye poora computer neat rehta hai: sabke mailbox saath, ek tick mein update hote hain.

Connections

Concept Map

adds Enable and complement S,R

feedback loop

two chained, opposite enables

produces

samples D at

output rule

holds value between edges

is only

contrast

causes transparency problem

solved by edge

building block of

SR latch NOR pair

Gated D latch

Bistable memory

Master-slave

Edge-triggered D flip-flop

Clock edge

Q_n+1 = D

Frozen output

Level-triggered

Data races through stages

Registers, counters, CPU