EE2301Dis12F09Sol

EE2301Dis12F09Sol - Department of Electrical and Computer...

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

View Full Document Right Arrow Icon
1 Department of Electrical and Computer Engineering University of Minnesota EE2301 Fall 2009 Introduction to Digital Systems Design L. L. Kinney Discussion XII Solutions 12/10-11: State Assignments and Construction of State Graphs. 1. Problem 15.22 in the text. Also, consider implementing the state table using a 3-bit, parallel loading up counter. (The counter has three functions synchronous clear, parallel load and increment.) Assuming state A is assigned 000, what state assignment(s) would minimize the number of parallel load operations required of the counter. Present State Next X = 0 State X = 1 Output Z A D G 1 B E H 0 C B F 1 D F G 0 E C A 1 F H C 0 G E A 1 H D B 0 (a) For the output, the following pairs should be adjacent: (A, C, E, G) and (B, D, F, H).
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 (b) From Guideline 1 (A, H), (B, G), (A, D) and (E, G) should be adjacent: From Guideline 2 (D, G), (E, H), (B, F), (F, G), (A, C), (C, H), (A, E), (B, D) Present State Next X = 0 State X = 1 Output Z A 000 D 001 G 011 1 D 001
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/20/2009 for the course EE 2301 taught by Professor Larrykinney during the Fall '09 term at Minnesota.

Page1 / 3

EE2301Dis12F09Sol - Department of Electrical and Computer...

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