hw4 - ECE 553: Testing and Testable Design of Digital...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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

Page1 / 3

hw4 - ECE 553: Testing and Testable Design of Digital...

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