- 2076 Chaitra · 2+6 marks
Asynchronous mod-12 down counter
Short answer
Combinational circuits depend only on present inputs; sequential circuits have memory and feedback. A mod-12 asynchronous down counter uses four negative-edge JK flip-flops (J=K=1) clocked from Q' of the previous stage. It counts 15 down to 4; when Q3=Q2=0 (state 0011), an OR gate presets all flip-flops to 1111, giving modulo 12.
Differentiate between combinational and sequential logic circuits. Construct and explain mod-12 asynchronous down counter with negative edge clock triggering system. Use JK flip-flops and necessary logic gates.
Combinational vs sequential logic circuits
| Point | Combinational circuit | Sequential circuit |
|---|---|---|
| Output depends on | Present inputs only | Present inputs and past state |
| Memory | No memory | Has memory (flip-flops/latches) |
| Feedback | No feedback path | Feedback from output to input |
| Clock | Not needed | Usually clocked |
| Analysis tool | Truth table | State table / state diagram |
| Examples | Adder, MUX, decoder | Flip-flop, register, counter |
Mod-12 asynchronous down counter (negative-edge JK)
Design idea
- 12 states need 4 flip-flops (). JK flip-flops with toggle on each falling clock edge.
- Down counting with negative-edge clocks: a stage must toggle when the previous output goes , i.e. when its goes . So FF0 gets CLK, and , , drive the clocks of FF1, FF2, FF3.
- Truncating to 12 states: a natural 4-bit down counter counts 15, 14, …, 0. We keep the 12 states 1111 (15) down to 0100 (4). When the count falls from 0100 to 0011, the counter is preset at once to 1111.
- Preset logic: 0011 is the only state reached in which (the ripple transients of the other steps never make both 0). An OR gate gives only then, and its output drives the active-low PRESET of all four flip-flops:
(If the count 11 → 0 is chosen instead, the reset state 1111 must be decoded, but 1111 also appears as a ripple transient when the count goes from 1000 to 0111, which would cause a false load. The 15 → 4 sequence avoids this.)
Circuit diagram
J=K=1 J=K=1 J=K=1 J=K=1
+-----+ +-----+ +-----+ +-----+
CLK-o FF0 |Q0'-o FF1 |Q1'-o FF2 |Q2'-o FF3 |Q3
+-----+ +-----+ +-----+ +-----+
(count is read from Q3 Q2 Q1 Q0; each FF has an
active-low PRESET input)
Q3 ---| |
| OR |----> PRESET of all FFs (active low)
Q2 ---| |
Count sequence
| Clock | Q3 Q2 Q1 Q0 | State |
|---|---|---|
| 0 | 1111 | 15 |
| 1 | 1110 | 14 |
| 2 | 1101 | 13 |
| … | … | … |
| 10 | 0101 | 5 |
| 11 | 0100 | 4 |
| 12 | 0011 → 1111 | preset to 15 |
Operation: each falling clock edge toggles FF0. When rises (0→1), falls and FF1 toggles, and so on, so the count decreases by one per pulse. After the 12th pulse the counter tries to enter 0011; the OR output goes low and presets all flip-flops to 1111, starting a new cycle of 12 states.
Timing diagram
CLK __|‾|_|‾|_|‾|_|‾|_|‾|_|‾|_|‾|_|‾|_|‾|_|‾|_|‾|_|‾|_|‾
Q3 ‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾|_______________|‾‾‾
Q2 ‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾|_______________|‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾
Q1 ‾‾‾‾‾‾‾‾|_______|‾‾‾‾‾‾‾|_______|‾‾‾‾‾‾‾|_______|‾‾‾
Q0 ‾‾‾‾|___|‾‾‾|___|‾‾‾|___|‾‾‾|___|‾‾‾|___|‾‾‾|___|‾‾‾
Cnt 15 14 13 12 11 10 9 8 7 6 5 4 15
completes one cycle every 12 clock pulses ().
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Asynchronous mod-12 up counter using JK · Digital Logic, chapter 8
- Mod-10 negative edge ripple counter with JK · Digital Logic, chapter 8
- Asynchronous mod-12 up counter, positive edge · Digital Logic, chapter 8 · asked 3×
- Synchronous circuits; asynchronous mod-12 counter · Digital Logic, chapter 8 · asked 2×
- SR equation; mod-5 counter using D flip-flops · Digital Logic, chapter 8
- MOD-6 synchronous counter, negative edge JK · Digital Logic, chapter 8 · asked 4×
- Combinational vs sequential; JK flip-flop · Basic Electronics Engineering, chapter 6
- Types of flip-flops; JK flip-flop · Basic Electronics Engineering, chapter 6 · asked 2×