State encoding is hard
With n state bits and m states, there are 2n! / (2n – m)! possible encodings [m ? n ? log m]
- 4 states in 3 state bits: 1,680 possible state assignments
- Draw K-maps for each possibility???
Hard problem, with no known algorithmic solution
- Apply heuristic approaches (with CAD-tool help)
- Gray-code – try to give adjacent states (states with an arc between them) codes that differ in only one bit position
- Random – computer tries random encodings
- Output – use outputs to help encode states
- One-hot – use as many state bits as there are states