Construct a one-hot state assignment for the states in the reduced state table o

Question

Construct a one-hot state assignment for the states in the reduced state table of part (a)

ADF are equivalent and replaced by a single state P new reduced states are P,Q, R,S. states ABCDEFGH are 0-equivalent states ACDEF and BGH are 1-equivalent meaning if u give a single bit sequence to these states the output will be same. states ADF , CE and BGH are 2-equivaLent meaning if u give a 2 bit sequence to these states the output will be same. 3. (a) Reduce the following state table to a minimum number of states.

Explanation / Answer

The one-hot assignment uses one flip-flop for each state, so a state machine with N states requires N flip-flops. Exactly one flip-flop is set to 1 in each state. For example, a system with four states (TO, T1, T2, and T3) could use four flip-flops (Q0, Q1, Q2, and Q3) with the following state assignment: TO: Q0 Q1 Q2 Q3 = 1000, T1: 0100, T2: 0010, T3: 0001 The other 12 combinations are not used. in above case the state assignments are P: Q0 Q1 Q2 Q3 = 1000, Q: 0100, R: 0010, S: 0001

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---