advertisement

Quiz 5 – Spring 2007 – EECS 270 Name: ____________________________________ uname: _________________ This quiz is graded out of 100 points. Please remember you can drop your lowest quiz score. You will have 25 minutes for the quiz. It is closed book and closed notes. Show your work and circle your answer! All outputs are zero Unless shown ~A/Y=1,Z=1 A/Y=1 Input is A Outputs are Y and Z R A/Y=1 S A/ ~A/Z=1 ~A/Y=1 T 1. Complete the timing diagram for the state machine shown above: [50] Clock A State Y Z R All outputs are zero Unless shown ~A/Y=1,Z=1 A/Y=1 Input is A Outputs are Y and Z R A/Y=1 S A/ ~A/Z=1 ~A/Y=1 T 2. For this problem, assign state bits S[1:0] as 00 for state R, 01 for state S, and 10 for state T. Using a K-map, find the minimal sum-of-products for next state (NS[1:0]) and the outputs (Y and Z). You must show your work to get any credit! [50] NS1= NS0= Y= Z=