Week7, Lecture1: Optimizing FSMs

Click here to start

Table of Contents

Optimizing FSMs
Optimizing FSMs for FPGAs
One-hot (one-cold) state assignment
Output-based encoding
Example: Traffic light controller
Traffic intersection
FSM I/O
State diagram
Symbolic state table 
Output-encoded state table
Example: FSM to write a memory
Two possible FSMs
FSM Partitioning
Mealy versus Moore partitions
Partitions are synchronous
Approach #1: Partition the combinational logic
Approach #2: Partition the machine
Introduce idle states
Partitioning rules
Partitioning rules (con’t)
Example: Six-state up/down counter
Example: 6 state up/down counter (con’t)
Approach #3: Extract subroutines
Example: Parallel decomposition
Serial decomposition
Minimize communication between partitions
Author: Chris Diorio 

Email: diorio@cs.washington.edu 

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