Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Successfully reported this slideshow.

Like this presentation? Why not share!

- Finite state machines by dennis gookyi 5704 views
- Introduction to State Machines by codeofficer 5912 views
- Finite state machines by grahamwell 1563 views
- Finite State Machines - Why the fear? by Mahesh Paolini-Su... 3029 views
- Moore and mealy machines by lavishka_anuj 38087 views
- Synchronous state machines. Moore ... by Mumbi Chishimba 7757 views

No Downloads

Total views

764

On SlideShare

0

From Embeds

0

Number of Embeds

9

Shares

0

Downloads

27

Comments

0

Likes

1

No embeds

No notes for slide

- 1. 1
- 2. 2
- 3. 3
- 4. 4
- 5. 5
- 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
- 8. 8
- 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. Moore Representation of the Problem 10
- 11. Truth and sequence tables of the above circuit 11
- 12. The design of Moore ASM 12
- 13. An Exercise • Represent the previous example using Mealy representation and implement it as a Mealy FSM. 13

No public clipboards found for this slide

Be the first to comment