5-M2 - Midterm 2 ECE 25 Fall 2007 Thursday November 29 Name...

Info iconThis preview shows pages 1–4. 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 1 + = 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 a) Fill out the following functions (OK to use in functions). F = S 1 += S 0 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 01 10 11 c) With initial state = 00 , what states, if any, are not reacheable? 2
Background image of page 2
Consider the following diagram. To avoid drawing many messy wires, the name of a wire is used in many cases instead. For example, the output of the far right D-FF, Q 0 , is connected to the input of the far right XOR gate.
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
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

5-M2 - Midterm 2 ECE 25 Fall 2007 Thursday November 29 Name...

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

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