EEE241 Digital Logic Design (DLD)

Lecture 27 – Sequential Circuits

Dr. Muhammad Rizwan Azam

COMSATS University Islamabad (CUI) Islamabad, Pakistan.
 Lecture Outline

• Analysis of Clocked Sequential Ccts.

• State Equation
• State Table
• State Diagram
• Analysis of F/Fs:
• D
• JK
• T
 Analysis of Clocked Sequential Circuits

• Analysis:
• Describes what a given circuit will do under certain operating conditions
• Behavior of the cct. is determined from:
• Inputs,
• Outputs
• State of its F/Fs.
• O/p and next states are determined from:
• Inputs
• Present state of its F/Fs.
• Analysis consists of obtaining:
• Table (State Table)
• Diagram (State Diagram)
• Boolean expressions (State Equations)
• for time sequence of inputs, outputs, and internal states
 Analysis of Clocked Sequential Circuits

• The State
• State = Values of all Flip-Flops

Example x
D Q A
AB=00

D Q B

CLK Q

y
 Analysis of Clocked Sequential Circuits

• State Equations
x
D Q A
A(t+1) = DA
= A(t) x(t)+B(t) x(t) Q
=Ax+Bx
B(t+1) = DB D Q B
= A’(t) x(t)
= A’ x CLK Q

y(t) = [A(t)+ B(t)] x’(t) y

= (A + B) x’
 Analysis of Clocked Sequential Circuits

• State Table (Transition Table)

x
Present Next D Q A
Input Output
State State
Q
A B x A B y
0 0 0 0 0 0 B
D Q
0 0 1 0 1 0
CLK Q
0 1 0 0 0 1
0 1 1 1 1 0 y

1 0 0 0 0 1
1 0 1 1 0 0
1 1 0 0 0 1
A(t+1) = A x + B x
1 1 1 1 0 0 B(t+1) = A’ x
y(t) = (A + B) x’
t t+1 t
 Analysis of Clocked Sequential Circuits

• State Table (Transition Table)

x
Present Next State Output D Q A

State x=0 x=1 x=0 x=1 Q

A B A B A B y y
0 0 0 0 0 1 0 0 D Q B
0 1 0 0 1 1 1 0
CLK Q
1 0 0 0 1 0 1 0
1 1 0 0 1 0 1 0 y

t t+1 t A(t+1) = A x + B x
B(t+1) = A’ x
y(t) = (A + B) x’
 Analysis of Clocked Sequential Circuits
 State Diagram
Present Next State Output
State x=0 x=1 x=0 x=1
AB input/output A B A B A B y y
0 0 0 0 0 1 0 0
0 1 0 0 1 1 1 0
0/0 1/0
1 0 0 0 1 0 1 0
0/1 1 1 0 0 1 0 1 0
00 10
x
D Q A

0/1 Q
1/0 0/1 1/0
D Q B

CLK Q
01 11
y

1/0
 Analysis of Clocked Sequential Circuits

• D Flip-Flops
Example:
x D Q A
Present Next y
Input
State State CLK Q
A x y A
0 0 0 0
0 0 1 1 A(t+1) = DA = A  x  y
0 1 0 1
0 1 1 0
1 0 0 1 01,10
1 0 1 0
00,11 0 1 00,11
1 1 0 0
1 1 1 1 01,10
 Analysis of Clocked Sequential Circuits

J Q A
• JK Flip-Flops
Example: x K Q

Present Next Flip-Flop

I/P J Q B
State State Inputs
A B x A B JA KA JB KB K Q
0 0 0 0 1 0 0 1 0 CLK
0 0 0 0 0 1
0 0 1 JA = B KA = B x’
0 1 0 1 1 1 1 1 0
JB = x’ KB = A  x
0 1 1 1 0 1 0 0 1
1 0 0 1 1 0 0 1 1 A(t+1) = JA Q’A + K’A QA
1 0 1 1 0 0 0 0 0 = A’B + AB’ + Ax
1 1 0 0 0 1 1 1 1 B(t+1) = JB Q’B + K’B QB
1 1 1 1 1 1 0 0 0 = B’x’ + ABx + A’Bx’
 Analysis of Clocked Sequential Circuits
J Q A
• JK Flip-Flops
x K Q
Example:

Present Next Flip-Flop J Q B

I/P
State State Inputs
K Q
A B x A B JA KA JB KB
CLK
0 0 0 0 1 0 0 1 0
0 0 1 0 0 0 0 0 1 1 0 1
0 1 0 1 1 1 1 1 0 00 11
0 1 1 1 0 1 0 0 1
0
1 0 0 1 1 0 0 1 1 0 0
1 0 1 1 0 0 0 0 0
1 1 0 0 0 1 1 1 1 01 10
1 1 1 1 1 1 0 0 0 1
1
 Analysis of Clocked Sequential Circuits
x A
T Q y
• T Flip-Flops
Example: R Q

Present Next F.F

I/P O/P
State State Inputs T Q
B
A B x A B TA TB y
R Q
0 0 0 0 0 0 0 0
0 0 1 0 1 0 1 0 CLK Reset
0 1 0 0 1 0 0 0
TA = B x TB = x
0 1 1 1 0 1 1 0
y =AB
1 0 0 1 0 0 0 0
1 0 1 1 1 0 1 0
A(t+1) = TA Q’A + T’A QA
= AB’ + Ax’ + A’Bx
1 1 0 1 1 0 0 1
1 1
B(t+1) = TB Q’B + T’B QB
1 1 1 0 0 1
=xB
 Analysis of Clocked Sequential Circuits
x A
T Q y
• T Flip-Flops
Example: R Q

Present Next F.F

I/P O/P
State State Inputs T Q
B
A B x A B TA TB y
R Q
0 0 0 0 0 0 0 0
0 0 1 0 1 0 1 0 CLK Reset
0 1 0 0 1 0 0 0 0/0 0/0
0 1 1 1 0 1 1 0 00 1/0 01
1 0 0 1 0 0 0 0
1 0 1 1 1 0 1 0 1/1 1/0
1 1 0 1 1 0 0 1 11 10
1 1 1 0 0 1 1 1 0/1 0/0
1/0