5-M2-soln

5-M2-soln - Midterm 2 ECE 25, Fall 2007 Thursday November...

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

View Full Document Right Arrow Icon
Consider the following incompletely-specified Moore machine (“X” indicates don’t cares). S 1 + S 0 + S 1 S 0 XY =00 01 10 11 F A B C X B 0 B A B X C X C C A X C 1 Suppose we use the following state encoding. State S 1 S 0 A 00 B 11 C 01 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 0 S 1 + = ¯ S 0 X + ¯ S 0 ¯ Y + S 1 ¯ S 0 + = X + S 1 Y + ¯ S 1 ¯ Y + ¯ S 1 ¯ S 0 OR = X + S 1 Y + ¯ S 1 ¯ Y + ¯ S 0 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
A B F OR AND D-FF D-FF XOR OR S 1 S 1 + S 0 S 0 + XOR Answer: a) Fill out the following functions (OK to use in functions). F = S 1 S 0 S 1 +=( S 1 + S 0 )+ S 0 B = S 1 + S 0 S 0 += A S 1 b) Assume initial state is 00 , fill in the following state table. If a state is not reacheable, indicate the appropriate don’t cares (use “X” to indicate don’t cares). S 1 + S 0 + S 1 S 0 AB =00 01 10 11 F 00 00 00 01 01 0 01 10 10 11 11 1 10 11 11 10 10 1 11 11 11 10 10 0 c) With initial state = 00 , 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.

Page1 / 5

5-M2-soln - Midterm 2 ECE 25, Fall 2007 Thursday November...

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