{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hw12 - ECE3060 Homework#12 due Thursday November 30 4:30pm...

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

ECE3060 November 23, 2006 Homework #12 due Thursday November 30 @ 4:30pm 150 points 1. (35) Consider the following state machine: Input Current State Next State Output 0 1 S1 S1 S2 S4 1 0 0 1 S2 S2 S1 S4 1 0 0 1 S3 S3 S5 S2 0 1 0 1 S4 S4 S2 S3 0 1 0 1 S5 S5 S3 S1 0 1 0 1 S6 S6 S2 S4 0 1 a. (5) Draw the state transition diagram. b. (25) Minimize the state machine using the state minimization algorithm taught in lecture. Show exactly how each step is reduced. Skipping any steps will lose points (even if you have the correct answer; in other words, points will be assigned for correct execution of the algorithm at each step in addition to obtaining the correct final result). c. (5) Redraw the reduced state transition diagram. 2. (75) Consider the following circuit: a. (20) Find all test vectors that can detect a stuck-at-one (s-a-1) fault at d using a method involving Boolean mathematics. (Please note that any answer not using Boolean logic will receive zero credit.) b.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

hw12 - ECE3060 Homework#12 due Thursday November 30 4:30pm...

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

View Full Document
Ask a homework question - tutors are online