Sequential Analysis_ An Example (First Steps) (optional)

Sequential Analysis_ An Example (First Steps) (optional) -...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Mallard ECE 290: Computer Engineering I - Spring 2007 - Graded Optio. .. https://mallard.cites.uiuc.edu/ECE290/webgrade.cgi?SessionID=mding3. .. 1 of 3 3/5/2007 10:57 PM Graded Optional Exercises: Sequential Analysis: An Example (First Steps) (optional) You have submitted this Optional Exercises 1 time (including this time). Sequential analysis refers to analyzing a sequential circuit in order to determine what the circuit does. Typically there are four steps: Write boolean expressions for the output function(s) and for the flip-flop inputs (the flip-flop excitation functions ). 1. Fill in the circuit's next-state table . This includes, for each current state and input combination, the next-state and the output(s) . 2. Draw a state diagram . This contains exactly the same information as the next-state table, but is in pictorial form. 3. Figure out what the circuit actually does! 4. The first three steps are "routine" because they are simply translating circuit information into a different form: no insight is needed. The last step can be hard: taking the information from the previous steps and
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

Sequential Analysis_ An Example (First Steps) (optional) -...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online