Procedure

Step 1: Study the given circuit. List

all inputs and outputs, and get the
EEE 21 Lecture #21 equations for all flip-flop inputs
Analysis of Sequential Circuits and system outputs.

Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC

Objective Example
Flip-flop
To determine the behavior of a inputs
given sequential circuit (circuit → Q2 J2
state diagram). X input Q2’ K2
output
Z
•Note: The maximum number of values that
n-bit memory can store is 2n. This is also the J1 Q1
maximum number of states that a sequential K1 Q1’ •Let state be represented
circuit with n flip-flops can have. by two bits: Q2Q1.
Flip-flop
inputs
Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC

1
 Flip-flop equations State Transition Table
Use the following format.
Q2 J2

X Q2’ K2
Circuit Inputs Current State Flip-flop Circuit O utputs Next State
Xi Qi Excitation Zi Q i+1

J1 Q1 •Begin by filling all possible combinations for

K1 Q1’ J1 = K1 = X columns Xi and Qi.
J2 = K2 = Z = Q2’(X+Q1) •Use the flip-flop input equations to fill up the
corresponding columns.
Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC

Procedure State Transition Table

Use the output equation to fill up
column Zi.
Step 2: Create a state transition
table to indicate the present state- Circuit Inputs Current State Flip-flop Circuit O utputs Next State
Xi Qi Excitation Zi Q i+1
to-next state transition of the
given sequential circuit. Finally, the entries in the last column are based on the
transition table of each flip-flop

Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC

2
 Example (continued) Example (continued)
Input Current State Flip-flop Output Next State Input Current State Flip-flop Output Next State
X Q2 Q1 J2 K2 J1 K1 Z Q2 Q1 X Q2 Q1 J2 K2 J1 K1 Z Q2 Q1
0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 1 1 1 0 0 1 1 1
0 1 0 0 1 0 0 0 0 0 0 1 0
0 1 1 0 1 1 0 0 0 0 0 1 1
1 0 0 1 0 0 1 1 1 1 1 1 1
1 0 1 1 0 1 1 1 1 1 1 1 0
1 1 0 1 1 0 0 0 1 1 0 1 1
1 1 1 1 1 1 0 0 1 1 0 1 0

Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC

Example (continued) Procedure

Input Current State Flip-flop Output Next State
X Q2 Q1 J2 K2 J1 K1 Z Q2 Q1
0 0 0 0 0 0 0 0
Step 3: Draw the state transition
0 0 1 1 1 0 0 1 diagram.
0 1 0 0 0 0 0 0
0 1 1 0 0 0 0 0
1 0 0 1 1 1 1 1
1 0 1 1 1 1 1 1
1 1 0 0 0 1 1 0
1 1 1 0 0 1 1 0

Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC

3
 State Transition Diagram Example (continued)
A state transition diagram (STD) State assignment:
represents each state as a bubble and
transitions as arrows. Let S0 represent Q1 = 0 & Q2 = 0
Let S1 represent Q1 = 0 & Q2 = 1
The number of states in the diagram is
Let S2 represent Q1 = 1 & Q2 = 0
equal to the number of unique values or
entries in the current state column (or Let S3 represent Q1 = 1 & Q2 = 1
next state column) of the state
transition table.

Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC

State Transition Diagram Example (continued)

Circuit Input/Output values are
normally indicated beside the transition 0/0
it is associated with. S0
The number of exit transitions from 1/1
each state is equal to 2n, where n is the 0/0 0/1 S1
number of circuit input bits. S3
1/0
The total number of transitions drawn in 1/1
the state diagram is equal to the 1/0
S2
number of unique rows in the state 0/0
transition table.

Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC

4
 Special States State Transition Diagram
Start-up states can only be entered
upon start-up (no arrows point to them, 00/0 10/1
Input/Output
except possibly those originating from
them). 2
01/1
00/0
Start-up 11/1
(all)/1
States that remain in the same state state 1 10/0 4
once entered (except upon reset) are
Terminal
called terminal states (no arrows go out 01/0 11/1 (all)/1
state
of them, except possibly those that Transitions 3
terminate at them).
States

Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC

Notes:
Not all sequential circuits have
start-up or terminal states.
A sequential circuit can have more
than one start-up state.
A sequential circuit can also have
more than one terminal state.
Anastacia P. Ballesil-Alvarez
Procedure
Step 1: Study the given circuit. List all
inputs and outputs, and get the
equations for all flip-flop inputs.
Step 2: Create a state transition table to
indicate the present state-to-next state
transition of the given sequential
circuit.
Step 3: Draw the state transition
diagram.
EEE Department, UP Diliman, QC Anastacia P. Ballesil-Alvarez EEE Department, UP Diliman, QC