Design a 110 Sequence Recognizer, Part II

Design a 110 Sequence Recognizer, Part II - Mallard ECE 290...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Mallard ECE 290: Computer Engineering I - Spring 2007 - Graded WebQuiz: Design a 1... Page 1 of 3 Graded Graded WebQuiz: Design a 110 Sequence Recognizer, Part II You have submitted this WebQuiz 1 time (including this time). You may submit this WebQuiz a total of 10 times and receive full credit. Please do Part I before doing this quiz. In this question you will use D flip-flops to implement the 110 recognizer from the previous webquiz. flipGiven below are the state diagram and Q1Q2 state assignment. 01, A = 01, B = 10, C = 00 (a) State Table Complete the state table given below, providing the next state Q1+Q2+, the output z, and the required flip-flop excitations D1 and D2. Use don't cares wherever possible. Current Current State Input Next State Output Q1 Q2 x Q1+ Q2+ 0 0 0 0 1 0 0 1 0 0 1 0 0 1 1 z FlipFlip-Flop Inputs D1 D2 1 0 1 0 0 0 0 0 1 0 0 1 1 1 0 0 1 0 0 0 0 1 0 0 1 1 0 1 0 0 0 0 0 1 1 0 X X X X X 1 1 1 X X X X X Your points: 100.00 (b) Minimal Boolean Expressions https://mallard.cites.uiuc.edu/ECE290/webgrade.cgi?SessionID=mding3_1070311_13325... 3/11/2007 Mallard ECE 290: Computer Engineering I - Spring 2007 - Graded WebQuiz: Design a 1... Page 2 of 3 Complete the K-maps and give minimal boolean expressions for z, D1, and D2. Q2x 00 01 01 0 10 11 0 0 Q1 10 0 X Q2'x'Q1' z = Q2'x'Q1' Enter a minimal SOP Boolean expression X z(Q1,Q2,x) z(Q1,Q2,x) Q2x 00 01 00 0 10 11 1 0 Q1 10 0 X Q2x D1 = Q2x Enter a minimal SOP Boolean expression X D1(Q1,Q2,x) D1(Q1,Q2,x) Q2x 00 01 01 0 Q1 11 0 11 0 10 1 X x D2 = x'' Enter a minimal SOP Boolean expression X D2(Q1,Q2,x) D2(Q1,Q2,x) ?Unused State Behavior State Q1Q2 = 11 is unused - a "don't care state". Suppose, however, that your circuit as implemented above does get into this state. From state Q1Q2 = 11 for your circuit: If x = 0 the next state is A If x = 1 the next state is B Does your circuit get stuck in state 11? no no Item 1: You have filled in all 40 entries in the table correctly. Item 2: You have filled in all 8 entries in the K map correctly. Item 4: You have filled in all 8 entries in the K map correctly. Item 6: You have filled in all 8 entries in the K map correctly. You received a raw score of 100% on this question. https://mallard.cites.uiuc.edu/ECE290/webgrade.cgi?SessionID=mding3_1070311_13325... 3/11/2007 Mallard ECE 290: Computer Engineering I - Spring 2007 - Graded WebQuiz: Design a 1... Page 3 of 3 WebQuiz WebQuiz Grade Summary Raw score Adjusted score Minimum passing score Grade for this submission Cumulative Cumulative Grade 100.00% 100.00% 60.00% 100% 100% To improve a grade, you must load a new quiz: NEW Quiz Mallard Copyright © 1995-2000 Course Content Copyright?1995-2007 Donna J. Brown. All rights reserved. https://mallard.cites.uiuc.edu/ECE290/webgrade.cgi?SessionID=mding3_1070311_13325... 3/11/2007 ...
View Full Document

This note was uploaded on 06/21/2011 for the course ECE 290 taught by Professor Staff during the Spring '08 term at University of Illinois, Urbana Champaign.

Ask a homework question - tutors are online