You are on page 1of 1

Seatwork Compilation

Problem: Use J-K Flip-Flops (A, B & C) to design a binary counter with the repeated sequence 0, 1, 2, 3, 4, 5
(a) Show the circuit’s Truth Table
(b) Derive each flip-flop’s input equations (SOP)
Solution:
Present State Next State Flip Flops Inputs
m
A B C A B C JA KA JB KB JC KC
J-K Flip Flop Excitation Table
0 0 0 0 0 0 1 0 x 0 x 1 x
Present State Next State Inputs
1 0 0 1 0 1 0 0 x 1 x x 1
Q(t) Q(t+1) J K
2 0 1 0 0 1 1 0 x x 0 1 x
0 0 0 x
3 0 1 1 1 0 0 1 x x 1 x 1
0 1 1 x
4 1 0 0 1 0 1 x 0 0 x 1 x
1 0 x 1
5 1 0 1 0 0 0 x 1 0 x x 1
1 1 x 0
6 1 1 0 x x x x x x
7 1 1 1 x x x x x x

For JA: For KA:


BC BC 00 01 11 10
00 01 11 10 A
A
0 0 0 1 0 0 x x x x
1 x x x x 1 0 1 x x

JA = BC KA = C

For JB: For KB:


BC
00 01 11 10 BC 00 01 11 10
A
A
0 0 1 x x
0 x x 1 0
1 0 0 x x
1 x x x x
JB = A’C KB = C

For JC: For KC:


BC BC 00 01 11 10
00 01 11 10
A A
0 1 x x 1 0 x 1 1 x
1 1 x x x 1 x 1 x x

JC = 1 KC = 1

COE117 LOGIC CIRCUITS AND THEORY SEATWORK NO. 4 COMPILATION PAGE 1