DOC PREVIEW
UIC ECE 465 - Lecture 7.3

This preview shows page 1-2-3-4-5-6-45-46-47-48-49-50-51-91-92-93-94-95-96 out of 96 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 96 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Some examplesGoalPrerequisitesHomeworkFurther readingsOutlineExample #7.3.1: rising edge detectorWaveformsSlide 9STGSlide 11Slide 12Slide 13Slide 14Slide 15Slide 16State encodingSTTSlide 19Slide 20PowerPoint PresentationSlide 22Example #7.3.2: palindrome string detectorSlide 24Slide 25Slide 26Slide 27Slide 28Slide 29Slide 30Slide 31Example #7.3.3: BCD big endianSolutionSlide 34Slide 35Slide 36Slide 37Slide 38Slide 39Slide 40Slide 41Slide 42Example #7.3.4: BCD little endianValid SequencesSlide 45Slide 46Example #7.3.5: parity checkerExampleSlide 49Slide 50Slide 51Slide 52Slide 53Slide 54Example #7.3.6: Ford Thunderbird light controllerSlide 56Slide 57Slide 58Slide 59Slide 60Turn to the leftSlide 62Slide 63Top levelInput prioritiesSolutionSlide 67Slide 68Slide 69Slide 70Slide 71Slide 72Slide 73Slide 74Slide 75Slide 76Slide 77Slide 78Slide 79Slide 80Slide 81Example #7.3.7: code checkerExample #7.3.7: code checker (cont’d)Slide 84Slide 85Slide 86Slide 87Slide 88Slide 89Example #7.3.8: sequence checkerSolution hintSlide 92Slide 93Slide 94Slide 95Slide 96Some examplesSome examplesSome examplesSome examplesPaolo PRINETTOPolitecnico di Torino (Italy)University of Illinois at Chicago, IL (USA)[email protected] [email protected] 7.32 7.3 Goal-This lecture guides the students through the solution of some simple examples of manual synthesis of sequential networks.3 7.3 Prerequisites -Lectures 7.1 and 7.24 7.3 Homework -Students are recommended to try to solve the exercise by themselves, before looking at the proposed solutions.5 7.3 Further readings -No particular suggestion6 7.3 OutlineOutline-Example #7.3.1: rising edge detector-Example #7.3.2: palindrome string detector-Example #7.3.3: BCD big endian-Example #7.3.4: BCD little endian-Example #7.3.5: parity checker-Example #7.3.6: Ford Thunderbird light controller-Example #7.3.7: code checker-Example #7.3.8: sequence checker7 7.3 Example #7.3.1: Example #7.3.1: rising edge detectorrising edge detectorA circuit is to be designed, having:-An input X-A clock signal CLK, which acts as a proper sampling signal of X, i.e., the frequency of CLK is such that it never happens that two transitions of X occur within a same CLK cycle-An output U, asserted for a clock cycle whenever a rising edge on the input X is detected.8 7.3 CLKXWaveforms9 7.3 CLKXZWaveforms10 7.3 STGresetH0H0,0,011 7.3 STGreset1H0H0,0,012 7.3 STGLL,0,0reset10H0H0,0,013 7.3 STGLL,0,0reset100H0H0,0,014 7.3 STGLL,0,0H1H1,1,1reset1010H0H0,0,015 7.3 STGLL,0,0H1H1,1,1reset1010H0H0,0,0016 7.3 STGLL,0,0H1H1,1,1reset1010H0H0,0,00117 7.3 State encodingstate encodingH0 00L 11H1 10STTLL,0,0H1H1,1,1reset1010H0H0,0,001state encodingH0 00L 11H1 10STTLL,0,0H1H1,1,1reset1010H0H0,0,001state encodingH0 00L 11H1 100 1 H0  00 11 00 001 - - 0 L  11 11 10 0 H1  10 11 00 1y[1:0]x Y[1:0] Z20 7.3 STT0 1 H0  00 11 00 001 - - 0 L  11 11 10 0 H1  10 11 00 1y[1:0]x Y[1:0] ZY[1] = x’ + y[0]Y[0] = x’Z = y[1]y[0]’21 7.3 DDDDxZD[1] = x’ + y[0]D[0] = x’Z = y[1]y[0]’SolutionD[0]y[1]y[0]D[1]22 7.3 OutlineOutline-Example #7.3.1: rising edge detector Example #7.3.2: palindrome string detector-Example #7.3.3: BCD big endian-Example #7.3.4: BCD little endian-Example #7.3.5: parity checker-Example #7.3.6: Ford Thunderbird light controller-Example #7.3.7: code checker-Example #7.3.8: sequence checker23 7.3 Example #7.3.2: Example #7.3.2: palindrome string detectorpalindrome string detectorOn a serial transmission line X, bits are transmitted synchronously w.r.t. a clock signal CLK, one bit per clock cycle.A circuit to be connected to the serial line is to be designed. It has an output U which is asserted whenever the last 4 values got in input forms a palindrome string.24 7.3 Example #7.3.2: Example #7.3.2: palindrome string detectorpalindrome string detectorOn a serial transmission line X, bits are transmitted synchronously w.r.t. a clock signal CLK, one bit per clock cycle.A circuit to be connected to the serial line is to be designed. It has an output U which is asserted whenever the last 4 values got in input forms a palindrome string.Examples:ANNA – 3993 – 011025 7.3 --01reset26 7.3 --0011010101reset27 7.3 --0011010111110000101001010101011001reset28 7.3 --001101011111000010100110111111110000001001000101010010011110011010reset29 7.3 --001101011111000010100110111111110000001001000110011011111111000000001001100101010100100111100110100 1101001U=0U=1reset30 7.3 --001101011111000010100110111111110000001001000110011011111111000000001001100101010100100111100110100 1101001U=0U=1reset31 7.3 OutlineOutline-Example #7.3.1: rising edge detector-Example #7.3.2: palindrome string detector Example #7.3.3: BCD big endian-Example #7.3.4: BCD little endian-Example #7.3.5: parity checker-Example #7.3.6: Ford Thunderbird light controller-Example #7.3.7: code checker-Example #7.3.8: sequence checker32 7.3 Example #7.3.3: Example #7.3.3: BCD big endianBCD big endianOn a serial transmission line X, bits are transmitted synchronously w.r.t. a clock signal CLK, one bit per clock cycle. The line is used to transmit groups of 4 bits: each group corresponding to a BCD digit, transmitted MSB first (big endian)A circuit to be connected to the serial line is to be designed. It has an output U which is asserted, for 1 clock cycle, in correspondence of the 4th bit of each group, if the group itself is a correct BCD digit. BCDBCD33 7.3 SolutionWhen dealing with circuits that must consider groups of bits, it may be convenient to start from a set of states, one for each possible combination of the PO values.BCDBCD34 7.3 SolutionA,0A,0E,1E,1reset0110BCDBCD35 7.3 SolutionA,0A,0E,1E,1B,0B,0reset0110-BCDBCD36 7.3 SolutionA,0A,0E,1E,1B,0B,0reset0110C,0C,0--BCDBCD37 7.3 SolutionA,0A,0E,1E,1B,0B,0reset0110C,0C,0D,0D,0---BCDBCD38 7.3 SolutionA,0A,0E,1E,1B,0B,0F,0F,0reset0110C,0C,0D,0D,0---BCDBCD39 7.3 SolutionA,0A,0E,1E,1B,0B,0F,0F,0reset0110C,0C,0D,0D,0--H,0H,01-BCDBCD40 7.3 SolutionA,0A,0E,1E,1B,0B,0F,0F,0reset0110C,0C,0D,0D,0I,0I,0--H,0H,0-1--BCDBCD41 7.3 SolutionA,0A,0E,1E,1B,0B,0F,0F,0reset01010C,0C,0G,0G,00D,0D,0I,0I,0--H,0H,0-11--BCDBCD42 7.3 OutlineOutline-Example #7.3.1: rising edge detector-Example #7.3.2: palindrome string


View Full Document
Download Lecture 7.3
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture 7.3 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture 7.3 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?