1 / 10

ECE122 – Lab 6 State Machines

The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering. ECE122 – Lab 6 State Machines. Ritu Bajpai Last revised on October 07, 2009. Introduction. State table gives a time sequence of inputs, outputs and flip flop states.

shea-nash
Download Presentation

ECE122 – Lab 6 State Machines

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The George Washington UniversitySchool of Engineering and Applied ScienceDepartment of Electrical and Computer Engineering ECE122 – Lab 6 State Machines Ritu Bajpai Last revised on October 07, 2009

  2. Introduction • State table gives a time sequence of inputs, outputs and flip flop states. • The information presented in the state table is graphically represented in a state diagram. • A state equation is an algebraic expression that specifies the conditions for a flip-flop state transition.

  3. Mealy and Moore State Machines • Mealy state machine has less number of states and the output depends on the input • Moore state machine, output only depends on the state

  4. Problem for the lab • Design Mealy and Moore machine to detect the sequence 1010 in a bit pattern. • Draw state table • Implement mealy state machine using D flip flops

  5. S4 Reset/0 1/0 S1 0/0 1/0 0/1 1/0 S3 0/0 0/0 S2 1/0 Mealy state machine

  6. Moore state machine 1 S5/1 0 0 S4/0 Reset S1/0 1 0 1 1 0 S3/0 0 S2/0 1

  7. Implementation of Mealy SM using DFF

  8. State equations DB=x DA=x’B+xAB’ y=ABx’

  9. Implementation

  10. Output response QA QB y nQA Clear nQB Clock x

More Related