Derivation and characteristic Table

R-S Flip Flop (Reset-Set)

Characteristic table
R (reset) S (set) Qn Qn+1
0 0 Latch
0 0 1 1 No change
0 1 Set made (set
0 1 1 1 makes the output
HIGH/1)
0 0 Reset Made (reset
1 0 1 0 makes the output
LOW/0)
0 x Undetermined
1 1 1 x mode

Excitation table

Qn Qn+1 R S Check the Qn and Qn+1 at characteristic table to see the

respective output

0 --> 0 X 0 Ex. Looking at Qn and Qn+1 at the table above, use the
0 --> 1 0 1 idea of kmap. At 00, R change from 0 --> 1 so it’s X (don’t
1 --> 0 1 0 care). The S didn’t (0 --> 0) so it’s 0. Use the same logic to
1 --> 1 0 X the rest.

D Flip Flop (Data/Delay)

Characteristic table
D Qn Qn+1
0 0
0 1 0
0 1
1 1 1

Excitation table
Qn Qn+1 D Looking at the table above, if D is 0,
0 --> 0 0 then output is 0 and 1 if 1.
0 --> 1 1
1 --> 0 0
1 --> 1 1

J-K Flip Flop

Characteristic table
J (set) K (reset) Qn Qn+1
0 0 Latch
0 0 1 1 No change
0 0 Reset made
0 1 1 0
 0 1 Set Made
1 0 1 1
0 1 toggle mode
1 1 1 0

Excitation table
Qn Qn+1 J K J-K and R-S is fairly similar aside from the result of 11

For R-S, 11 is undetermined

For J-K, 11 is toggle
0 --> 0 0 X
0 --> 1 1 X Additionally:
1 --> 0 X 1 R-S is Reset-Set
1 --> 1 X 0 J-K is Set-Reset

T Flip Flop (toggle)

Characteristic table
T Qn Qn+1
0 0 Latch
0 1 1 No change
0 1 Toggle
1 1 0

Excitation table
Qn Qn+1 T
0 --> 0 0
0 --> 1 1
1 --> 0 1
1 --> 1 0

State Diagram and State table

- Is a directed graph that describe the state of a process

Logic:
Different outputs is required defending on the situation but for this example, we’re gonna use a 1111
output

The process will continue only if the required output is met, looking at the diagram, the process only
continue when the input is 1 but it’ll start over when it receives a input of 0.

State Table
Present State Next State Output
X=0 X=1 X=0 X=1
a Za b 0 0
b a c 0 0
c a d 0 0
d a d 0 1

Steps for making Sequence Detector (Shortcut)

*Sample using J-K f/f*

Step 1: Draw the state diagram

0/0

1/0
00
0/1
0/1
1/1 10
11

0/1 01
1/1

1/0
Step 2: Construct excitation table (J-K)

Qn Qn+1 J K
0 --> 0 0 X
0 --> 1 1 X
1 --> 0 X 1
1 --> 1 X 0

Step 3: State table

This is a shortcut. To do this the present state will compared to next state as you would normally
do.
But this time no need to do state assessment as you need the raw node equivalent.

Ex. Present state = 00

Next state = 00

The first digit will be Your A and second will be B. You can then directly get the excitation from
there. Mind the color of what is being compared.

Present State Input Output Next State F/f

A B A+ B+ Ja Ka Jb Kb
0 0 0 0 0 0 0X 0X
0 0 1 0 0 1 0X 1X
0 1 0 1 0 1 0X X0
0 1 1 1 1 0 1X X1
1 0 0 1 1 1 X0 1X
1 0 1 0 1 0 X0 0X
1 1 0 1 0 0 X1 X1
1 1 1 1 1 1 X0 X0

Step 4: K-Mapping

F/f Using the result from state table, we can now do the
Ja Ka Jb Kb kmap on Ja, Ka, Jb, Kb, and Y(output)
0 X 0 X
Ja
0 X 1 X 00 01 11 10
0 X X 0 B’X’ B’X BX BX’
1 X X 1
0 A’ 0 0 1 0
X 0 1 X Ex.
X 0 0 X 1 A X X X X
At
X 1 X 1 00 (present state AB) with 0 (input X) Ja is 0
X 0 X 0 At 00 with 1, Ja is 0

Ka
00 01 11 10
B’X’ B’X BX BX’
A’ X X X X
0
1 A 0 0 0 1

Jb 00 01 11 10
B’X’ B’X BX BX’
A’ 0 1 X X
A 1 0 X X
 0
1
Kb

00 01 11 10

B’X’ B’X BX BX’

0 A’ X X 1 0
1 A X X 0 1

00 01 11 10
B’X’ B’X BX BX’
A’ 0 0 1 1
0
1 A 1 0 1 1

Ja = BX
Ka = BX’
O
Jb = A’X + AX’ = A + X
O
Kb = A’X + AX’ = A + X
Y = B + AX’

Step 5: Draw circuit