{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

ECE354 hw5

# ECE354 hw5 - (b What is the 1’s count in the presence of...

This preview shows page 1. Sign up to view the full content.

NEW JERSEY INSTITUTE OF TECHNOLOGY DEPT. OF ELECTRICAL & COMPUTER ENGINEERING Refer to the following circuit whenever applicable: A B C D F 1 g 2 g 3 g 4 g 5 g 6 g 7 g 8 g 9 g 10 g 11 g Fig. 1. Circuit for HW5 1. Compute a test pattern for 1 / 3 g using the D-algorithm. 2. Prove that 0 / 4 g is undetectable using the D-algorithm. 3. The circuit is fed with the exhaustive set progressing in the binary count order, i.e. ABCD =0000,0001,0010,0011,…,1110,1111. The output responses are accumulated in a 1’s counter. (a) What is the expected 1’s count for the good circuit?
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (b) What is the 1’s count in the presence of 1 / 9 g ? 4. The circuit is fed with the exhaustive set progressing in the binary count order, i.e. ABCD =0000,0001,0010,0011,…,1110,1111. The output responses are accumulated in a transition counter. (a) What is the transition count for the good circuit? (b) What is the transition count in the presence of / 3 g ? 5. Repeat Pb. 4 if the input vector set is ABCD =0000,0001,0010,0101,0110,1001,1010. 1...
View Full Document

{[ snackBarMessage ]}