ECE 375: Digital Design II

Class 10

Sometimes the most "optimal" state assignments can be slow. To fix this, we use a different state optimization method.

One Hot State Assignment

Using the following state machine:

Number of states = Number of flip-flops

Input -> x Output -> Z

Q1 Q2 Q3
A 1 0 0
B 0 1 0
C 0 0 1

Q1+ = x'Q1 + x'Q3 Q2+ = xQ1 + xQ2 + xQ3 Q3+ = x'Q2

Z = x'Q1 + xQ2 + xQ3

One Moore Example

comedy

Q1+ = x'Q1 + x'Q2 Q2+ = xQ1 + xQ2 + xQ3 Q3+ = x'Q2

Z = Q2 + Q3