Week3, Lecture2: Review state machines

Click here to start

Table of Contents

Review state machines
Finite state machine (FSM) model
State diagrams
Counters: Simple FSMs
Counter design procedure
Example: A 5-state counter
Step 3: Encode the next state functions
Step 4: Implement the design
Robust design
Self-starting counters
FSM design
Moore versus Mealy machines
Specifying outputs for a Moore machine
Specifying outputs for a Mealy machine
Moore versus Mealy machines
Synchronous (or registered) Mealy machine
FSM design procedure
Example: A vending machine
1a. State diagram
1b. Symbolic state-transition table
2. State minimization
3. State encoding
4. Minimize the logic
5. Implement the design
Moore versus Mealy vending machine
One-hot encoding
One-hot encoded vending machine
One-hot encoded vending machine (con’t)
State-assignment approaches
A design guideline		 Author: Chris Diorio 

Email: diorio@cs.washington.edu

Home Page: http://www.cs.washington.edu/education/courses/467/99au/