lOMoARcPSD|10784334

Lecture 8 Sequential circuit

Logic Circuit Design (City University of Hong Kong)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university

Downloaded by Sigma Imposium ([email protected])
 lOMoARcPSD|10784334

EE2000 Logic Circuit Design

Sequential Logic Circuit Design

Outline
• 7.1 Finite State Machines
– Concepts of States
– Mealy machines
– Moore machines
– Excitation table
– Design example
• 7.2 Sequential Circuit Analysis

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Sequential and combinational circuits

Switching system: a combinational Sequential circuit: the system outputs are
circuit which transforms the input dependent not only on the present input
excitation to its corresponding output, conditions but also on the past history of the
the input and output are all function of system. The past history is usually regarded
states which obviously require memory devices
time. The output is dependent only on to remember their states.
the present input conditions.

combinational circuit sequential circuit

x1 z1
xn Combinational zm
logic
x1(t) z1(t)
Switching
x2(t)
circuit
x3(t) z2(t) y1 yr Yr Y1

Memory

clock

zi(t) = f (xi(t)) zi(t) = f (xi(‐∞, t))

Synchronous and asynchronous

systems
• Synchronous sequential systems in which the
change of state takes place at discrete instants
of time defined by a synchronizing input called
the clock.
• Asynchronous sequential systems, the states
can change at any time as a function of input
changes, there is no external synchronization.

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

States
• With continuous inputs, the input time functions
can be group into classes.
• All time functions have the same effect on the
output at time t.
• Practically, the number of classes is finite.
• These classes are represented by the auxiliary
variables si called states.
• States summarize the effect of past inputs.
• Make decision for present and future outputs.

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

States machine
• The state machine is illustrated using state
diagram. A state diagram consists of circles which
present the states; and lines connecting the
circles that represent the transition of states.
• Mealy machine S
x/y
S i j

FF
Input
Combinational
logic
Com.
logic
Output S = state
FF
x = input
y = output

• Moore machine Si /0
x
Sj /1
FF
Input
Combinational Com.
Output
logic logic
FF

Mealy Machine

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Mealy Machine

Mealy Machine

10

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Mealy Machine

11

Mealy Machine

12

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Moore Machine

13

Moore Machine

14

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Moore Machine

15

Differences
Mealy machine Moore machine

• The output of Moore machine is related to

the current state only
‐ The output will not change despite of the changes appears at
the input
‐ The output is stable, because it depends solely on the state
which is the group of storage elements

16

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Differences
Mealy machine Moore machine

• The output of Moore machine is related to

the current state only
‐ The output will not change despite of the changes appears at
the input
‐ The output is stable, because it depends solely on the state
which is the group of storage elements

17

Excitation Table of D‐FFs

18

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Excitation Table of JK‐FFs

19

Traffic Light Circuit

20

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Design Example
Free‐running Counter
Design a free‐running counter with counting sequence
2, 4, 5, 3, 7, 2, …(and repeat) using D flip‐flops

21

Free‐running Counter
Moore Machine Structure

2, 4, 5, 3, 7, 2,

22

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Free‐running Counter

23

Free‐running Counter

24

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Free‐running Counter

25

Free‐running Counter

Z1

26

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Free‐running Counter

Verification
required for
bit checking!

27

Free‐running Counter

Verification
required for
bit checking!

0
1 1
1
0 1

0 1 0

28

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Free‐running Counter

29

Free‐running Counter

Z1

30

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

7.2 Sequential Circuit Analysis

• To analysis a sequential circuit
‐ To verify the circuit
‐ To determine its state model
‐ To obtain its state diagram
‐ To obtain its state table
‐ To obtain its state equation

31

Analysis Example

32

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Analysis Example

33

Analysis Example

34

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Write the Analysis Table

35

Write the Analysis Table

36

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

Write the Analysis Table

37

Write the Analysis Table

38

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

State Table and State Diagram

39

State Equation

40

Downloaded by Sigma Imposium ([email protected])

 lOMoARcPSD|10784334

41

Downloaded by Sigma Imposium ([email protected])