PPT Slide
7 – Sequential Logic Examples
n states encoded using n flipflops
- easiest to design/debug/extend (bit per state)
- HG = 0001 HY = 0010 FG = 0100 FY = 1000
Small logic functions
- each state function only requires predecessor states' bits as input
- complexity of functions directly related to complexity of state diagram
- one product term per incoming arc
- very common in PLDs
Impractical for large machines
- too many states require too many flip-flops
- decompose state machines into smaller pieces that can be one-hot encoded
- n+m states for two machines (n and m states, respectively) versus n*m states for a single one