This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: ECE 553: Testing and Testable Design of Digital Systems Department of Electrical and Computer Engineering University of WisconsinMadison ECE 553 : Testing and Testable Design of Digital Systems Fall 2011 Assignment #4 Date: Thursday, October 25, 2011 Due date : Thursday, November 3, 2011 1. (Bushnell and Agrawal) Problem 8.2 2. (Bushnell and Agrawal) Problem 8.4 3. (Bushnell and Agrawal) Problem 8.6 4. (Bushnell and Agrawal) Problem 8.12 5. The finite state machine M 7 in Table 1 has a single input, a single output, and 5 states. (a) Is this a strongly connected machine? (b) Find a shortest synchronizing sequence for this machine. (To make grading easier, please designate the left branches of your tree correspond to Input = 0 for all trees in parts (b), (c), and (d).) (c) Find a minimum length distinguishing sequence . Tabulate the output responses, initial and final states of applying your distinguishing sequence to the machine in each of the 5 starting states....
View Full Document
- Winter '08