4-M2-soln

4-M2-soln - Midterm 2 Solutions ECE 25, Spring 2008...

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

View Full Document Right Arrow Icon
Midterm 2 Solutions ECE 25, Spring 2008 Tuesday, May 20, 2008 Name: PID: Problem Points Score 1 10 2 10 3 10 4 10 5 10 Total 50 Consider the following incompletely-specified Moore machine (“*” indicates don’t cares). S 1 + S 0 + S 1 S 0 I =0 I =1 F A A C 1 B C A 0 C B * 0 Suppose we use the following state encoding. State S 1 S 0 A 01 B 11 C 00 Derive the minimum two-level logic for each of the following (you should minimize each logic function separately, no need to worry about sharing logic between logic functions). F = ¯ S 1 S 0 S 1 + = ¯ S 0 S 0 + = ¯ I ¯ S 1 + IS 1 0 * 1 0 01 0 1 S 0 F S 1 1 0 * 0 0 * 0 * 1 1 * 0 0 * 1 * 00 01 11 10 S 1 S 0 S 0 + 00 01 11 10 S 1 S 0 S 1 + 00 01 00 01 II 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
I F D-FF XOR XOR XOR S 1 S 1 + D-FF S 0 S 0 + a) Fill out the following functions (OK to use in functions). F = S 1 S 0 S 1 += I S 0 S 0 ¯ I S 1 b) Assume initial state is 11 , fill in the following state table. If a state is not reacheable, indicate the appropriate don’t cares (use “*” to indicate don’t cares). S 1 + S 0 + S 1 S 0 I =0 I =1 F 00 01 10 0 01 11 00 1 10 00 11 1 11 10 01 0 c) With initial state = 11 , what states, if any, are not reacheable?
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 01/09/2012 for the course CSE 140 taught by Professor Rosing during the Spring '06 term at UCSD.

Page1 / 5

4-M2-soln - Midterm 2 Solutions ECE 25, Spring 2008...

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