Create a FSM that detects the input bit pattern ‘01’. The output will be ‘0’ until the exact pattern ‘01’ is received. At the point of receiving ‘01’, the FSM will output 1, and then go back to output ‘0’ until the next ‘01’ is received.
1) Draw the Moore FSM diagram for the above
2) Write the FSM tables:
a. State Assignment (Gray Encoding)
b. State Output
c. State Transition Tables
3) Simplify the Output logic (use K-Map if necessary)
4) Simplify the State Transition logic (use K-Map if necessary)
5) Draw the circuit for the FSM
In Moore Machine, the output is associated with the states.
So, the machine to design is to be in moore and the conditions are,
- Untill the pattern "01" is matched, the output will be 0.
- When patter "01" is matched, the output will be 1.
1) Moore FSM state diagram
Let we have 3 states: A, B, C and outputs are associated with the state. A is the initial state,
2) FSM Table :
Present State | Input = 0 | Input = 1 | Output |
A | B | A | 0 |
B | B | C | 0 |
C | B | A | 1 |
Get Answers For Free
Most questions answered within 1 hours.