Sequential Circuits:
Finite State Machine(FSM)
Outline
Introduction
• A finite state machine(FSM) is a machine that has
many states and has a logical way of changing
from one state to the other under guiding rules.
Introduction (cont’d)
Mealy Machine
• A Mealy machine is an FSM whose output
depends on the present state as well as the present
input.
• In Mealy machine every transition for a particular
input symbol has a fixed output.
Mealy Machine
Moore Machine
• A Moore machine is an FSM whose output
depends on the present state only.
Moore Machine
Example: Odd Parity Checker
Assert output whenever input bit stream has odd # of 1's
Reset Present State Input Next State Output
Even 0 Even 0
Even 0 Even 1 Odd 0
[0] Odd 0 Odd 1
Odd 1 Even 1
1 1 Symbolic State Transition Table
Odd
[1] Present State Input Next State Output
0
0 0 0 0
0 1 1 0
1 0 1 1
State 1 1 0 1
Diagram
Encoded State Transition Table
10