Successfully reported this slideshow.
Upcoming SlideShare
×

# Finite State Machines

764 views

Published on

Finite State Machine

Published in: Engineering
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

### Finite State Machines

1. 1. 1
2. 2. 2
3. 3. 3
4. 4. 4
5. 5. 5
6. 6. Moore State Diagram In the key diagram, A and B the states, X represent the outputs, and the (i) represents the input. 6
7. 7. 7
8. 8. 8
9. 9. Example of a FSM; Moore representation • Problem Statement • A finite state machine has 8 distinct states , state (S1) to state 8 (S8) in addition to the Reset state 0 (S0). If the machine is in state i (Si), you can transfer it to any other state by applying the number of the required state to the input of the machine. For every state there are 7 transitions which take the machine from the current state to the other 7 states. The state transition diagram in the next slide shows the Reset state and the transitions of states 2 and 3. • The output accompanying each state is shown in the output truth table in the next slide. • The next state table shows the next state depending on the input and the current state. 9
10. 10. Moore Representation of the Problem 10
11. 11. Truth and sequence tables of the above circuit 11
12. 12. The design of Moore ASM 12
13. 13. An Exercise • Represent the previous example using Mealy representation and implement it as a Mealy FSM. 13