JK Analisis

Synchronous Sequential Circuit Analysis
With J_K Flip-Flop
Synchronous Sequential Circuit
State Memory A set of n edge-triggered flip-flops that store the

current state of the machine
All flip-flops are triggered from the same master clock signal
All change state together
Combinational circuit
Next state logic
Output logic Mealy and Moore
Inputs
Current
State
Combinational
circuit
State Memory
Clock
Outputs
Next
State
Mealy Model
next state = F (current state, inputs)

outputs = G (current state, inputs)
Moore Model

outputs = G (current state)
Analysis - Goals
Characterize as Mealy or Moore machine

Determine next state equations, i.e., find the function F
Determine output equations
Meally: outputs = F (current state, inputs), or
Moore: outputs = F (current state)
Express as machine behavior
State table, or
State diagram
Formulate English description of machine behavior
An example sequential circuit
A sequential circuit with two JK flip-flops

State or memory: Q1Q0
One input: X; One output: Z
6
State table of example circuit
Present State
Q1
Q0
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
Inputs
X
0
1
0
1
0
1
0
1
Next State
Q1
Q0
Outputs
Z
Output Equations
From the diagram, you can see that

Z = Q1Q0X
Mealy model circuit !!!
Present State
Q1
Q0
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
Inputs
X
0
1
0
1
0
1
0
1
Next State
Q1
Q0
Outputs
Z
0
0
0
0
0
0
0
1
8
Next State Equations Q(t+1)
Find the flip-flop input equations/excitation equations

Substitute excitation equations in the flip-flops characteristic equation
J1 = X Q0
K 1 = X + Q0
J0 = X + Q 1
K0 = X
Next State Equations Q(t+1)
Excitation equations:
J1 = X Q0 and K1 = X + Q0
J0 = X + Q1 and K0 = X
Characteristic equation of the JK flip-flop:
Q(t+1) = KQ(t) + JQ(t)
Next state equations:

Q1(t+1) = K1Q1(t) + J1Q1(t)
= (X + Q0(t)) Q1(t) + X Q0 (t) Q1(t)
= X (Q0(t) Q1(t) + Q0(t) Q1(t))
= X (Q0(t) Q1(t))
Q0(t+1) = K0Q0(t) + J0Q0(t)

= X Q0(t) + (X + Q1(t)) Q0(t)
= X + Q0(t) Q1(t)
10
State Table & Next State Equations
Q1(t+1) = X (Q0(t) Q1(t))
Q1=0, Q0=0, X= 0 => Q1(t+1)= 0
Q0(t+1) = X + Q0(t) Q1(t)
Q1=0, Q0=0, X= 0 => Q0(t+1)= 0

Present State
Q1
Q0
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
Inputs
X
0
1
0
1
0
1
0
1
Next State
Q1
Q0
0
Outputs
Z
0
0
0
0
0
0
0
1
11
Q1(t+1) = X (Q0(t) Q1(t))
Q1=0, Q0=1, X= 1 => Q1(t+1)= 0
Q0(t+1) = X + Q0(t) Q1(t)
Q1=0, Q0=1, X= 1 => Q0(t+1)= 1

Present State
Q1
Q0
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
Inputs
X
0
1
0
1
0
1
0
1
Next State
Q1
Q0
0
Outputs
Z
0
0
0
0
0
0
0
1
12
Q1(t+1) = X (Q0(t) Q1(t))
Q0(t+1) = X + Q0(t) Q1(t)

Present State Inputs Next State Outputs
Q1
Q0
X
Q1
Q0
Z
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
0
0
1
0
1
0
0
0
0
1
0
1
1
1
0
1
0
0
0
0
0
0
0
1
13
State Table & Characteristic Table
The general JK flip-flop characteristic equation is:

Q(t+1) = KQ(t) + JQ(t)
We can also determine the next state for each input/current state
combination directly from the characteristic table
J
Q(t+1)
Operation
0
0
1
1
0
1
0
1
Q(t)
0
1
Q(t)
No change
Reset
Set
Complement
14
With these equations, we can make a table showing J 1, K1, J0 and K0

for the different combinations of present state Q1Q0 and input X
J1 = X Q0
J0 = X + Q 1
K1 = X + Q 0
K0 = X
Present State
Q1
Q0
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
Inputs
X
J1
0
1
0
1
0
1
0
1
0
0
1
0
0
0
1
0
Flip-flop Inputs
K1
J0
0
1
1
1
0
1
1
1
0
1
0
1
1
1
1
1
K0
1
0
1
0
1
0
1
0
15
16
17
A different look
Q1
Q0
X
Q1
Q0
Z
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
0
0
1
0
1
0
0
0
0
1
0
1
1
1
0
1
Output
Next State
Present State
Q1
Q0
0
0
0
0
0
0
0
1
Input
Input
X= 0
X= 1
X= 0
X= 1
18
State diagrams (Mealy model)

We can also represent the state table graphically with a state diagram
A diagram corresponding to our example state table is shown below
input
Q1
Q0
X
Q1
Q0
Z
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
0
0
1
0
1
0
0
0
0
1
0
1
1
1
0
1
0
0
0
0
0
0
0
1
output
0/0
00
0/0
11
1/0
1/0
1/1
0/0
01
1/0
0/0
10
state
19
Sizes of state diagrams

Always check the size of your state diagrams
If there are n flip-flops, there should be 2n nodes in the diagram
If there are m inputs, then each node will have 2m outgoing arrows
In our example,
We have two flip-flops, and thus four states or nodes.
There is one input, so each node has two outgoing arrows.
0/0
00
0/0
11
1/0
1/0
1/1
0/0
01
1/0
0/0
10
20
Another Mealy Circuit
21
Excitation Equations
D0 = EN Q0 + EN Q0
D1 = EN Q1 + EN Q1 Q0 + EN Q1 Q0
22
Next State/Output Equations
Q0(t+1) = D0 = EN Q0 + EN Q0
Q1(t+1) = D1 = EN Q1 + EN Q1 Q0 + EN Q1 Q0
MAX= EN Q1 Q0
23
Mealy State Table

Q0(t+1) = D0 = EN Q0 + EN Q0
Q1(t+1) = D1 = EN Q1 + EN Q1 Q0 + EN Q1 Q0
MAX= EN Q1 Q0
Output
Next State
Present State
Q1
Q0
MAX
Input
Input
EN= 0
EN= 1
X= 0
X= 1
1
24
Mealy State Diagram
Output
Next State
Present State
Q1
Q0
MAX
Input
Input
EN= 0
EN= 1
X= 0
X= 1
25
Moore Circuit
Remove input
connection to
output logic =>
Moore machine
26
Next State/Output Equations
Q0(t+1) = D0 = EN Q0 + EN Q0
Q1(t+1) = D1 = EN Q1 + EN Q1 Q0 + EN Q1 Q0
MAX= Q1 Q0
27
Moore State Table

Q0(t+1) = D0 = EN Q0 + EN Q0
Q1(t+1) = D1 = EN Q1 + EN Q1 Q0 + EN Q1 Q0
MAX= Q1 Q0
Next State
Present State
Output
Input
Input
Q0
EN= 0
EN= 1
Q1
MAX
28
Moore State Diagram
Output
Next State
Present State
Q1
Q0
MAX
Input
Input
EN= 0
EN= 1
X= 0
X= 1
29
State Transitions
MAX : Output of the Mealy circuit

MAXS : Output of the Moore circuit
30
Sequential circuit analysis summary
To analyze sequential circuits, you have to:
Find Boolean expressions for the outputs of the circuit and the
flip-flop inputs
Use these expressions to fill in the output and flip-flop input columns
in the state table
Finally, use the characteristic equation or characteristic table of the
flip-flop to fill in the next state columns.
The result of sequential circuit analysis is a state table or a state

diagram describing the circuit
31

JK Analisis

Încărcat de

Informații document

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

JK Analisis

Încărcat de

Drepturi de autor:

Formate disponibile

Synchronous Sequential Circuit Analysis

With J_K Flip-Flop

Synchronous Sequential Circuit

State Memory A set of n edge-triggered flip-flops that store the

next state = F (current state, inputs)

next state = F (current state, inputs)

Characterize as Mealy or Moore machine

An example sequential circuit

A sequential circuit with two JK flip-flops

State table of example circuit

From the diagram, you can see that

Next State Equations Q(t+1)

Find the flip-flop input equations/excitation equations

Next State Equations Q(t+1)

Characteristic equation of the JK flip-flop:

Q(t+1) = KQ(t) + JQ(t)

Next state equations:

Q0(t+1) = K0Q0(t) + J0Q0(t)

State Table & Next State Equations

Q1(t+1) = X (Q0(t) Q1(t))

Q1=0, Q0=0, X= 0 => Q1(t+1)= 0

Q0(t+1) = X + Q0(t) Q1(t)

Q1=0, Q0=0, X= 0 => Q0(t+1)= 0

State Table & Next State Equations

Q1(t+1) = X (Q0(t) Q1(t))

Q1=0, Q0=1, X= 1 => Q1(t+1)= 0

Q0(t+1) = X + Q0(t) Q1(t)

Q1=0, Q0=1, X= 1 => Q0(t+1)= 1

State Table & Next State Equations

Q1(t+1) = X (Q0(t) Q1(t))

Q0(t+1) = X + Q0(t) Q1(t)

State Table & Characteristic Table

The general JK flip-flop characteristic equation is:

State Table & Characteristic Table

With these equations, we can make a table showing J 1, K1, J0 and K0

State Table & Characteristic Table

State Table & Characteristic Table

State diagrams (Mealy model)

Sizes of state diagrams

Another Mealy Circuit

Next State/Output Equations

Mealy State Table

Mealy State Diagram

Next State/Output Equations

Moore State Table

Moore State Diagram

MAX : Output of the Mealy circuit

Sequential circuit analysis summary

To analyze sequential circuits, you have to:

The result of sequential circuit analysis is a state table or a state

S-ar putea să vă placă și