Table of Contents
Outline
Clocked Synchronous Finite-State Machines
Definition: Mealy Machine
Definition: Moore Machine
Design Example: Inputs, Outputs and States
Next-State and Output Functions
How About a Moore Machine?
State/Output Transition Table and Transition Diagram: Moore Machine
Conversion to Mealy Machine
Machine Equivalence
State Minimization of Completely-Specified Machines
Design Example: State Minimization
Design Example: State Minimization
State Assignment
Design Example: State Assignment Minimum-Length Code
Implementation Using D Flip-Flops
Design Example: State Assignment One-Hot Code
Steps to FSM Design
State Minimization Using an Implication Table
State Minimization Using am Implication Table: Summary of Approach
Implication Table Example: Pass 0
Implication Table Example: Pass 1 and Pass 2
Implication Table Example: Final State Table
Steps to FSM Design
Guidelines for State Assignment
But How Do You Actually Do It?
State Assignment: Design Example
State Assignment: Design Example
State Assignment: Design Example
Steps to FSM Design
Guidelines for Determining Flip-Flop Input Equations from Next-State Map
Flip-Flop Input Equations From Next-State Map: Example
Next-State Maps: Design Example
Steps to FSM Design
Next-State Maps: Summary of Example
Derive Output Equations from Output Maps
Steps to FSM Design
|