Table of ContentsOutline 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 andTransition Diagram: Moore Machine Conversion to Mealy Machine Machine Equivalence State Minimization ofCompletely-Specified Machines Design Example: State Minimization Design Example: State Minimization State Assignment Design Example: State AssignmentMinimum-Length Code Implementation Using D Flip-Flops Design Example: State AssignmentOne-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 InputEquations 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 |
Email: rnewton@ic.eecs.berkeley.edu
Home Page: http://www-inst.eecs.Berkeley.edu/~cs150 |