Coursehero >> California >> USC >> EE 201L

Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.

5 ee102_midterm1_Sp2005_Q5_4_alternative_solutions.fm Alternative solutions to Q#5 of EE102L Spring 2005 Midterm #1 Serial Voting Machine: We want to design a serial voting machine which inspects THREE votes serially. In this design we need to produce TWO inferences, WON and LOST. RESET START Vcc D3 N.C. (No Connection) TC Q3 Q2 Q1=S1 Q0=S0 V0 Vcc VCC VCC D2 D1 I0 I1 V1 Vcc CEP CET V S1 S0 S0 S1 Q1 MC3 Q0 CONTROL UNIT D0 PE 74LS163A CP MR ACK V2 I2 Vcc I3 COUNT QC QC1N Enable SYSCLK QI NOTE Q1 Q0 Q2 MC2 Q1 Q0 MC4 NOTE Synchronous Master Reset (clear) Solution #1 (as given in my hand-written solution) RESET START mc1.V START mc2.V V C1N COUNT <= COUNT + 1 Three votes can be cast in 8 ways. Combination Won/Lost Sequence of states I COUNT <= 0 C COUNT <= COUNT + 1 mc1.V mc2.V ACK ACK WON ACK V0 Yes Yes Yes V Yes No No LOST No ACK No V1 Yes Yes No No Yes Yes No No V2 Yes No Yes No Yes No Yes No Won Won Won Lost Won Lost Lost Lost C C C C C C C C C Won C Won C C1N Won C C1N Lost C1N C1N Won C1N C1N Lost C1N Lost C1N Lost In addition to the hand-written solution above (distributed to students at the end of the test), I am giving below three other less-efficient solutions for which we will give credit in grading. (These less efficient solutions are similar to Q#3.2 of EE102L Midterm #2 of Spring 2004.) They are less efficient because they take an extra clock in some cases. The first two of the three solutions given below require altering the first line of sequence of states already given by me. So ideally they are not acceptable solutions, but .... The last two of the 3 alternatives require redrawing the waveforms given in my hand-written solution. 4/20/06 EE102L Midterm #1 - Spring 2005 1/2 C Copyright 2005 Gandhi Puvvada ee102_midterm1_Sp2005_Q5_4_alternative_solutions.fm #2 Solution (slightly inefficient) The conditions associated with the 3 arrows from state C and/or C1N are different. RESET START mc2.V START mc2.V mc2.V C1N COUNT <= COUNT + 1 Three votes can be cast in 8 ways. Combination Won/Lost Sequence of states I COUNT <= 0 C COUNT <= COUNT + 1 mc2 mc2.V ACK ACK WON ACK V0 Yes Yes Yes V Yes No No LOST No ACK No V1 Yes Yes No No Yes Yes No No V2 Yes No Yes No Yes No Yes No Won Won Won Lost Won Lost Lost Lost C C C C C C C C C C Won C C Won C C1N Won C C1N Lost C1N C1N Won C1N C1N Lost C1N Lost C1N Lost Solution #3 (more inefficient) The conditions associated with the 3 arrows from states C and C1N are different. RESET START mc2.V START mc3.V mc2.V C1N COUNT <= COUNT + 1 Three votes can be cast in 8 ways. Combination Won/Lost Sequence of states I COUNT <= 0 C COUNT <= COUNT + 1 mc2 mc3 mc3.V ACK ACK WON ACK LOST ACK V0 Yes Yes Yes Yes No No No No V1 Yes Yes No No Yes Yes No No V2 Yes No Yes No Yes No Yes No Won Won Won Lost Won Lost Lost Lost C C C C C C C C C C Won C C Won C C1N C1N Won C C1N Lost C1N C1N C1N Won C1N C1N Lost C1N Lost C1N Lost Solution #4 (slightly inefficient) The conditions associated with the 3 arrows from state C1N are different. RESET START mc1.V START mc3.V V C1N COUNT <= COUNT + 1 Three votes can be cast in 8 ways. Combination Won/Lost Sequence of states I COUNT <= 0 C COUNT <= COUNT + 1 mc1.V mc3 mc3.V ACK ACK WON ACK LOST ACK V0 Yes Yes Yes Yes No No No No V1 Yes Yes No No Yes Yes No No V2 Yes No Yes No Yes No Yes No Won Won Won Lost Won Lost Lost Lost C C C C C C C C C Won C Won C C1N C1N Won C C1N Lost C1N C1N C1N Won C1N C1N Lost C1N Lost C1N Lost 4/20/06 EE102L Midterm #1 - Spring 2005 2/2 C Copyright 2005 Gandhi Puvvada

Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents: