Design a MOD-6 synchronous DOWN counter using J-K flip-flops.
20 marks · directive: Design
The core of a good answer
Using three J-K flip-flops counting 5, 4, 3, 2, 1, 0, 5, ... (101 to 000) with 110 and 111 as don't-cares, the minimised excitations are J₀ = K₀ = 1, J₁ = Q₂Q̄₀, K₁ = Q̄₀, J₂ = Q̄₁Q̄₀, K₂ = Q̄₀, all flip-flops clocked together; the unused states 110 and 111 return to the count (111 → 110 → 001), so the counter is self-starting.
An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work
What the question asks
A synchronous design question: choose the number of flip-flops, write the state table for the down sequence, convert it to J-K excitations, minimise with K-maps using unused states as don't-cares, draw the circuit and check for lock-out.
Answer outline
Introduction
A MOD-6 counter needs n flip-flops with 2ⁿ ≥ 6, so n = 3 (Q₂ MSB, Q₁, Q₀ LSB). The down count chosen is 101 → 100 → 011 → 010 → 001 → 000 → 101.
Step 1: J-K excitation table
- Q → Q⁺ : 0 → 0 needs J = 0, K = X; 0 → 1 needs J = 1, K = X; 1 → 0 needs J = X, K = 1; 1 → 1 needs J = X, K = 0
Step 2: State table (Q₂Q₁Q₀ → next, then J₂K₂ J₁K₁ J₀K₀)
- 000 → 101: 1X 0X 1X
- 001 → 000: 0X 0X X1
- 010 → 001: 0X X1 1X
- 011 → 010: 0X X0 X1
- 100 → 011: X1 1X 1X
- 101 → 100: X0 0X X1
- 110 and 111: unused, all inputs don't-care
Step 3: K-map minimisation
- Q₀ toggles every clock: J₀ = 1, K₀ = 1
- J₁ = 1 only at 100 (110 don't-care): J₁ = Q₂Q̄₀
- K₁ = 1 at 010, 0 at 011: K₁ = Q̄₀
- J₂ = 1 only at 000 (100 don't-care): J₂ = Q̄₁Q̄₀
- K₂ = 1 at 100, 0 at 101: K₂ = Q̄₀
Step 4: Circuit
- Three J-K flip-flops share one clock line (synchronous).
- FF0: J₀ and K₀ tied to logic 1 (toggle).
- FF1: J₁ from a 2-input AND of Q₂ and Q̄₀; K₁ from Q̄₀.
- FF2: J₂ from a 2-input AND of Q̄₁ and Q̄₀ (or a NOR of Q₁ and Q₀); K₂ from Q̄₀.
- Outputs Q₂Q₁Q₀ read the count; only two AND gates are needed.
Step 5: Verification and lock-out check
- Simulating the equations: 000→101→100→011→010→001→000, the required sequence.
- Unused 110: J₀K₀ = 11, J₁K₁ = 11, J₂K₂ = 01, so next state 001.
- Unused 111: J₀K₀ = 11, J₁K₁ = 00, J₂K₂ = 00, so next state 110, then 001.
- No lock-out: the counter enters the main sequence within two clocks.
Step 6: Timing behaviour
- All flip-flops change on the same clock edge, so there is no ripple delay; maximum clock frequency is set by one flip-flop delay plus one gate delay.
- A decoded 000 state can be used as the terminal count (borrow) output for cascading.
Conclusion
The design uses three J-K flip-flops and two AND gates with J₀ = K₀ = 1, J₁ = Q₂Q̄₀, K₁ = Q̄₀, J₂ = Q̄₁Q̄₀, K₂ = Q̄₀, and it is self-correcting from the unused states.
Examples and data to cite
- A MOD-10 (decade) counter with four flip-flops uses only ten of its 16 possible states; in the same way this MOD-6 counter uses six of the eight states of three flip-flops.
- The 74190 and 74191 are synchronous presettable up/down 4-bit decade and binary counters, built on the same synchronous principle.
Facts to remember
- Number of flip-flops: smallest n with 2ⁿ ≥ modulus.
- J-K excitation: 0→0 (0,X), 0→1 (1,X), 1→0 (X,1), 1→1 (X,0).
- Unused states are don't-cares in minimisation but must be checked for lock-out.
- In a synchronous counter all flip-flops are clocked simultaneously.