chap15 - Last updated: 11/4/2006 ECEn/CS 224 Chapter 15...

Info iconThis preview shows pages 1–3. 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: Last updated: 11/4/2006 ECEn/CS 224 Chapter 15 Homework Solutions 15.1 Draw the state graph and corresponding transition table for a 3-bit counter with no control inputs and which counts in multiples of 3. That is, the count sequence is: 000 - 011 - 110 - 000. Use don't cares in the transition table as appropriate. Q2 Q1 Q0 N2 N1 N0 0 0 0 0 1 1 0 1 1 1 1 0 1 1 0 0 0 0 0 0 1 x x x 0 1 0 x x x 1 0 0 x x x 1 0 1 x x x 1 1 1 x x x 15.2 Draw the state graph and corresponding transition table for a 3-bit binary counter with no control inputs and which counts down rather than up. Include a Z output which signifies when the count value modulo 3 is equal to 0. Q2 Q1 Q0 N2 N1 N0 Z 0 0 0 1 1 1 1 1 1 1 1 1 0 0 1 1 0 1 0 1 1 1 0 1 1 0 0 0 1 0 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 0 0 1 0 0 0 1 0 0 0 0 Last updated: 11/4/2006 15.3 Draw the state graph for a 3-bit counter which counts in the gray code shown below. Include a Z output which signifies when the even/odd characteristic of the current state and of the next state values (when interpreted as unsigned integers) are the same. That is, if the transition is 000 b 010 (0 b 2) the output should be asserted. However, if the 2) the output should be asserted....
View Full Document

Page1 / 4

chap15 - Last updated: 11/4/2006 ECEn/CS 224 Chapter 15...

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

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