Sequential Circuits Analysis

 Topics
 Input Equation
 State table
 Sequential Circuits Types
 (Mealy and Moore Models of Finite State
Machines)
 State diagram
 Analysis with D flip flop
 Analysis with JK flip flop
 Analysis with T flip flop

1 EC 381 Digital Systems Fall 2013

 Review: Flip Flops

Characteristics Table Characteristics Equation

Q(t+1)=D

Q(t + 1) = T  Q = T’Q + TQ’

2 EC 381 Digital Systems Fall 2013

Analysis of Sequential Circuits
 Earlier we learned how to analyze combinational
circuits
 Now extend to synchronous sequential
 We’ll use
 state tables and
 state diagrams

3 EC 381 Digital Systems Fall 2013

Analysis of Sequential Circuits

4 EC 381 Digital Systems Fall 2013

Analysis Procedure
The basic procedure involves the following:
 Identify the flip-flops used to hold the current state information.
 Identify the outputs of the circuit.
 Write down the input equations (equations that specify the input to
FF).
 Write down the logic equation for the output.
 Write down the state equation or transition equations (equations that
describe next state of FFs in terms of input and present states.)
 From state equations derive the state table.
 Obtain a state diagram from state equations.

 Note : the flip-flop input equations are sometimes called the

excitation equation

5 EC 381 Digital Systems Fall 2013

Input Equations (Excitation Equations)
 Input equations describe inputs to FF with logic
equations

6 EC 381 Digital Systems Fall 2013

Input Equations
 Input equations describe inputs to FF with logic
equations

J A  ( XB  Y C ) K A  (YB  C )

7 EC 381 Digital Systems Fall 2013

Another Example (Input/Out equations)

8 EC 381 Digital Systems Fall 2013

Another Example

DA  ( AX  BX )

DB  A X

Y  ( A  B) X

9 EC 381 Digital Systems Fall 2013

Input Equations
 The input equations
 Imply the type of flip-flop from the letter symbols,
for example DA, DB indicate D flip flop
JA, KA indicate JK Flip flop
 Fully specify the combinational circuit that drives
the flip-flops.

10 EC 381 Digital Systems Fall 2013

State Equations
 Write down all FF characteristics equations.
 Plug in the input equation s into characteristics
equations to find out the state equations.
 For DFF state equation is the same as Input equations

11 EC 381 Digital Systems Fall 2013

State Table
 State table is a truth table with state added
 A sequential circuit with `m’ FF and `n’ inputs needs
2m+n rows in state table.
m=2, n=1  8 rows

DA  ( AX  BX ) DB  A X Y  ( A  B) X
12 EC 381 Digital Systems Fall 2013
State Table
 State table is a truth table with state added
 A sequential circuit with `m’ FF and `n’ inputs needs
2m+n rows in state table.
m=2, n=1  8 rows

DA  ( AX  BX ) DB  A X Y  ( A  B) X
13 EC 381 Digital Systems Fall 2013
State Table
 Two Dimensional Table
 Same thing, different layout

14 EC 381 Digital Systems Fall 2013

State Table
 Two Dimensional Table
 Same thing, different layout

15 EC 381 Digital Systems Fall 2013

State Diagram

16 EC 381 Digital Systems Fall 2013

Mealy and Moore Models of Finite State Machines

17 EC 381 Digital Systems Fall 2013

 Sequential Circuit Types
The two models of a sequential circuit are referred to as a finite
state machine (FSM)
 Moore model –  Mealy model – outputs
outputs depend on depend on inputs &
present states only. states

18 EC 381 Digital Systems Fall 2013

State Diagram: Mealy Model
 State diagram is an alternative representation to State
Table

19 EC 381 Digital Systems Fall 2013

State Diagram: Mealy Model
 State diagram is an alternative representation to State
Table Input
Output

State number

Input/Output

20 EC 381 Digital Systems Fall 2013

State Diagram: Moore
 D flip flop Analysis example
1- find input equations

2- next state equation

21 EC 381 Digital Systems Fall 2013

State Diagram: Moore
 D flip flop Analysis example
1- find input equations

2- next state equation

3-State table

22 EC 381 Digital Systems Fall 2013

State Diagram: Moore
 D flip flop Analysis example
1- find input equations

2- next state equation

3-State table

4- State diagram

Inputs
State

0 1

23 EC 381 Digital Systems Fall 2013

State Table vs. Diagram
 Same information
 Table is perhaps easier to fill in from description
 Diagram is easier for understanding and writing code
 Analysis for sequential circuits that employs D type
flip flops is easy (i.e. next state values are obtained
directly from the input equations)

24 EC 381 Digital Systems Fall 2013

Mealy vs Moore Models
 In a Moore model, the outputs of the sequential
circuit are synchronized with the clock, because
they depend only on flip-flop outputs that are
synchronized with the clock.
 the output of the Mealy machine is the value that is
present immediately before the active edge of the
clock.

25 EC 381 Digital Systems Fall 2013