Sequential

Circuit
Analysis

1
Flip Flop Equation &
Table

2
Example
Draw the Circuit diagram for below Table.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 3
Analaysis
Generating Next State
Use K maps generated from State Table

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 4
Analaysis
Circuit

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 5
Analaysis
Pre-Request
1. State Equation
2. State Table
3. State Diagram

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 6
Analaysis
State Equation
The behavior of a clocked sequential circuit can be
described algebraically by means of state equations.

 A state equation(also called a transition equation) species

the next state as a function of the present state and inputs.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 7
Analaysis
Example

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 8
Analaysis
State Equation

D= A⊕x⊕y
Q(t+1)=D

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 9
Analaysis
State Table
The time sequence of inputs, outputs, and ip-op states can be
enumerated in a state table (sometimes called a transition table ).
The table consists of four sections labeled present state, input, next
state, and output .
The derivation of a state table requires listing all possible binary
combinations of present states and The derivation of a state table
requires listing all possible binary combinations of present states and
inputs.
The next-state values are then determined from the logic
diagram or from the state equations.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 10
Analaysis
State Table

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 11
Analaysis
State Diagram
The information available in a state table can be
represented graphically in the form of a state diagram.
In this type of diagram, a state is represented by a circle,
and the (clock-triggered) transitions between states are
indicated by directed lines connecting the circles.
The directed lines are labeled with two binary numbers
separated by a slash. The input value during the present
state is labeled rst, and the number after the slash gives the
output during the present state with the given input.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 12
Analaysis
State Diagram
Design a 2 bit up counter that has no preset state and continually cycles
thought the 4 states.
This can be defined by a table – called a state table.
Present State Next State
00 01
01 10
10 11
11 00

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 13
Analaysis
A diagram
representation
This form is termed a state diagram

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 14
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 15
Analaysis
Analysis of Clocked
Sequential circuits
•State and Output Equations
•State Table
•State Diagram

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 16
Analaysis
Analysis is describing what a given circuit will do
The output of a clocked sequential circuit is determined by
1. Inputs
2. State of the Flip-Flops

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 17
Analaysis
Analysis Procedure:
1. Obtain the equations at the inputs of the Flip-Flops
2. Obtain the output equations
3. Fill the state table for all possible input and state values
4. Draw the state diagram
Sequential Circuit
analysis

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 19
Analaysis
Step1
For DA have an AND-OR set of gates to generate the input.
◦ The upper AND gate has inputs X and A
◦ The lower AND gate has inputs X and B
◦ So DA = AX + BX

For DB have a single AND gate whose inputs are X and A’

◦ So DB = A’X

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 21
Analaysis
Step2: output Y
The OR gate has inputs A and B
This feeds into a 2-input AND gate whose other input is X’
Thus Y = (A+B)X’

Now having these equations can construct the state table for the state
machine

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 22
Analaysis
 ◦ DA = AX + BX

Step3: State Table ◦ DB = A’X

◦ Y = (A+B)X’

Present state Input Next State Output

A B X A B
The state table
For generation of the next state you have the Present State as indicated
by A and B plus the input X. This next state becomes the current state
on the clock.

DA = AX + BX
DB = A’X
Y = (A+B)X’

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 24
Analaysis
 Second form of State
Table

Present State Next State Output

X=0 X=1 X=0 X=1
A B A B A B A B A B

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 25
Analaysis
Another form of the
state table
Two-dimensional form of the same table

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 26
Analaysis
Step4: State Diagram
 The state Diagram
The state diagram for this systems is
Not the notation on the diagram
◦ On transition arcs – input/output

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 28
Analaysis
Combinational Vs
Sequential Circuit

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 29
Analaysis
Example

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 30
Analaysis
Flip-Flop Input Equation:
D= A⨁x ⨁y
Next State Equation: A(t+1)= A⨁x⨁y

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 31
Analaysis
State Diagram

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 32
Analaysis
Example
A Sequential circuit with 2 D flip flops A and B, two inputs x and y, and
one output z is specified by the following next state and output
equation.
A(t+1)= x’y+xB
B(t+1)=x’A+xB
Z=A
1. Draw the logic diagram of the circuit.
2. List the state table for the sequential circuit.
3. Draw the corresponding state diagram.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 33
Analaysis
 Analysis of JK Flip
Flop

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 34
Analaysis
Next State Equation

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 35
Analaysis
State Table

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 36
Analaysis
State Diagram

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 37
Analaysis
State Diagram

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 38
Analaysis
Analysis of T flip flop

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 39
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 40
Analaysis
State Diagram

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 41
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 42
Analaysis
 Types Clocked
Sequential Circuit

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 43
Analaysis
There are two ways to design a clocked sequential circuit:
They differ only in the way the output is generated.

1. Mealy Machine:
the output is a function of both the present state and the input.

2. Moore Machine:
Outputs depend on present state only.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 44
Analaysis
Finite State
Machine(FSM)
The two models of a sequential circuit are commonly referred
to as a finite state machine, abbreviated FSM.

The Mealy model of a sequential circuit is referred to as a

Mealy FSM or Mealy machine.

The Moore model is referred to as a Moore FSM or Moore

machine.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 45
Analaysis
Example of Mealy
machine
Output y is a function of both input x and the present state of
A and B.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 46
Analaysis
Example of Moore
machine
The output depends only on ip-op values, and that makes
it a function of the present state only.
The input value in the state diagram is labeled along the
directed line, but the output value is indicated inside the
circle together with the present state.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 47
Analaysis
 x=0/y=0 x=0/y=1 x=1/y=0

AB
00 x=0/y=11 0

x=1/y=0
x=1/y=0
x=0/y=1

01 11
x=1/y=0

2025.03.23 SEQUENTIAL CIRCUITS PJF - 48

Mealy and Moore
Sequential machines are typically classified as either a Mealy machine
or a Moore machine implementation.
Moore machine: The outputs of the circuit depend only upon the
current state of the circuit.
Mealy machine: The outputs of the circuit depend upon both the
current state of the circuit and the inputs.

9/15/09 - L22 Sequential Circuit

49
Design
 State Reduction
Technique
&
Assignment

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 50
Analaysis
Why
Two sequential circuits may exhibit the same input-output
behavior, but have a different number of internal states in
their state diagram.

The current section discusses certain properties of

sequential
circuits that may simplify a design by reducing the number
of
gates and ip-ops it uses.

Reducing the number of ip-ops reduces the cost of a circuit.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 51
Analaysis
Cont
The reduction in the number of ip-ops in a sequential circuit is referred
to as the state-reduction problem.

 State-reduction algorithms are concerned with procedures for

reducing the number of states in a state table, while keeping
the external input-output requirements unchanged.

Since m ip-ops produce 2m states, a reduction in the

number of states may (or may not) result in a reduction in the
number of ip-ops.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 52
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 53
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 54
Analaysis
Steps:
Two states are said to be equivalent if, for each member of
the set of inputs, they give exactly the same output and send
the circuit either to the same state or to an equivalent state.

When two states are equivalent, one of them can be removed

without altering the input-output relationships.

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 55
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 56
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 57
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 58
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 59
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 60
Analaysis
 State Assignment

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 61
Analaysis
In order to design a sequential circuit with physical components, it is
necessary to assign unique coded binary values to the states.
For a circuit with m states, the codes must contain n bits,
where 2^n > m

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 62
Analaysis
9/15/09 - L21 Sequential Circuit
COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 63
Analaysis
Popular State
Assignment’s
 synchronous sequential
circuits

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 65
Analaysis
 Design procedure of synchronous sequential
circuits:

! Derive a state diagram for the circuit from specifications

! Reduce the number of states if necessary
! Assign binary values to the states
! Obtain the binary-coded state table
! Choose the type of flip-flop to be used
! Derive the simplified flip-flop input equations and output
equations
! Draw the logic diagram

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 66
Analaysis
Example problem

9/15/09 - L21 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 67
Analaysis
Step1

68
Synthesis Using D Flip-Flops
DA = Ax +Bx
DB = Ax + B`x
y = AB

69
Synthesis Using D Flip-Flops

70
Example

9/15/09 - L22 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 71
Design
Now generate a state
table
The state table
This can be done directly from the state diagram.

Now need to do a state assignment

9/15/09 - L22 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 72
Design
Select a state
assignment
Will select a gray encoding
For this state A will be encoded 00, state B 01, state C 11 and
state D 10

9/15/09 - L22 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 73
Design
Flip-flop input
equations
Generate the equations for the flip-flop inputs
Generate the D0 equation

Generate the D1 equation

9/15/09 - L22 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 74
Design
The output equation
The next step is to generate the equation for the output Z and what is
needed to generate it.
Create a K-map from the truth table.

9/15/09 - L22 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 75
Design
Now map to a circuit
The circuit has 2 D type F/Fs

9/15/09 - L22 Sequential Circuit

COPYRIGHT 2009 - JOANNE DEGROAT, ECE, OSU 76
Design