Some additional examplesGoalPrerequisitesHomeworkFurther readingsOutlineAddress decoderRT level solutionSlide 9Slide 10Slide 11Slide 12Slide 13Logic level solutionSlide 15Logic level solution (cont’d)Slide 17The “morra” gameSlide 19Slide 20SolutionPowerPoint PresentationSlide 23Keyboard encoderSlide 25Slide 26Slide 27Solution #1 – Implementation by a ROMSlide 29Solution #2 – Implementation by EspressoSlide 31Slide 32Slide 33Slide 34Slide 35Slide 36Solution #3 – RT level implementationSlide 38Slide 39Slide 40Slide 41Slide 42Slide 43Slide 44Slide 45Slide 46OptimizationSlide 48Slide 49Some additional Some additional examplesexamplesSome additional Some additional examplesexamplesPaolo PRINETTOPolitecnico di Torino (Italy)University of Illinois at Chicago, IL (USA)[email protected] [email protected] 6.62 6.6 Goal-This lecture presents some additional examples of combinational synthesis, exploiting the design methodologies presented in lectures 6.4-6.53 6.6 Prerequisites -Lectures 6.4 and 6.54 6.6 Homework -Students are warmly encouraged to solve the proposed exercises5 6.6 Further readings -No particular suggestion6 6.6 Outline-Address decoder-“l gieug d’ la mora” (the “morra” game)-Keyboard encoder7 6.6 Address decoderDesign a device to be connected to a 12-bits address bus A[11:0], whose output U is asserted whenever:03F < A[11:0] < 8008 6.6 RT level solution03F < A[11:0] < 8009 6.6 RT level solution03F < A[11:0] < 800A[11:0]10 6.6 RT level solution03F < A[11:0] < 800A[11:0]03F<<12 bits11 6.6 RT level solution03F < A[11:0] < 800A[11:0]03F<<12 bits03F < A[11:0]12 6.6 RT level solution03F < A[11:0] < 800A[11:0]03F<<12 bits800<<12 bits03F < A[11:0] A[11:0] < 80013 6.6 RT level solution03F < A[11:0] < 800A[11:0]03F<<12 bits800<<12 bitsU03F < A[11:0] A[11:0] < 80014 6.6 03F < A[11:0] < 800 is equivalent to:040  A[11:0]  7FF and thereof:0000 0100 0000  A[11:0]  0111 1111 1111 Logic level solution15 6.6 03F < A[11:0] < 800 is equivalent to:040  A[11:0]  7FF and thereof:0000 0100 0000  A[11:0]  0111 1111 1111 .i 12 .o 1 01-- ---- ---- 1 0-1- ---- ---- 1 0--1 ---- ---- 1 0--- 1--- ---- 1 0--- -1-- ---- 1 .eLogic level solution16 6.6 .i 12 .o 1 01-- ---- ---- 1 0-1- ---- ---- 1 0--1 ---- ---- 1 0--- 1--- ---- 1 0--- -1-- ---- 1 .eLogic level solution (cont’d)A[11]A[10:6]U17 6.6 Outline-Address decoder-“l gieug d’ la mora” (The “morra” game)-Keyboard encoder18 6.6 The “morra” gameWe have to design a circuit capable of detecting the winners in the “morra” play. Such a play involves 2 players. Each player provides:-A number in the range 0-5, called PLAY-A number in the range 0-10, called TOT19 6.6 The “morra” gameThe circuits has 2 outputs WIN1 and WIN2, which are asserted when the player 1 or 2 is winning, respectively:PLAY1TOT1PLAY2TOT2WIN1WIN220 6.6 The “morra” gameEach player aims at guessing the value:PLAY1+PLAY2. Thus:-if TOT1=PLAY1+PLAY2 , player 1 wins-if TOT2=PLAY1+PLAY2 , player 2 wins21 6.6 Solution-WIN1 = 1 iff TOT1 = PLAY1 + PLAY2-WIN2 = 1 iff TOT2 = PLAY1 + PLAY222 6.6 PLAY1 PLAY2==TOT2WIN2==TOT1WIN1++3 344 4-WIN1 = 1 iff TOT1 = PLAY1 + PLAY2-WIN2 = 1 iff TOT2 = PLAY1 + PLAY223 6.6 Outline-Address decoder-“l gieug d’ la mora” (the “morra” game) Keyboard encoder24 6.6 Keyboard encoder0481 2 35 6 79 * #0481 2 35 6 79 * #25 6.6 The decoder get in input:-3 signals R1…R3 , one for each key row-4 signals C1…C4 one for each key columnEach signal is asserted whenever a key belonging to the corresponding row (or column) is pressed0481 2 35 6 79 * #Keyboard encoder26 6.6 The decoder provides:-An output VALID, asserted whenever one (and just one) key is pressed-An encoding, on 4 bits, of the pressed key(* and # are coded as 10 and 11, respectively).0481 2 35 6 79 * #Keyboard encoder27 6.6 Keyboard encoderRVALIDCODEC0481 2 35 6 79 * #0481 2 35 6 79 * #Keyboard encoder28 6.6 RVALIDCODEC75ROMROM128x5128x50481 2 35 6 79 * #Solution #1 –Implementation by a ROM29 6.6 RVALIDCODEC75ROMROM128x5128x50481 2 35 6 79 * #Solution #1 –Implementation by a ROMRR11RR22RR33CC11CC22CC33CC44AA66AA55AA44AA33AA22AA11AA0030 6.6 Solution #2 –Implementation by Espresso0481 2 35 6 79 * #31 6.6 .i 7.o 50481 2 35 6 79 * #32 6.6 .i 7.o 5000 ---- 0 ------- 0000 0 ----0481 2 35 6 79 * #Rows Columns VALID CODE33 6.6 .i 7.o 5000 ---- 0 ------- 0000 0 ----11- ---- 0 -----11 ---- 0 ----1-1 ---- 0 ----0481 2 35 6 79 * #34 6.6 .i 7.o 5000 ---- 0 ------- 0000 0 ----11- ---- 0 -----11 ---- 0 ----1-1 ---- 0 ------- 11-- 0 ------- 1-1- 0 ------- 1--1 0 ------- -11- 0 ------- -1-1 0 ------- --11 0 ----0481 2 35 6 79 * #35 6.6 .i 7.o 5000 ---- 0 ------- 0000 0 ----11- ---- 0 -----11 ---- 0 ----1-1 ---- 0 ------- 11-- 0 ------- 1-1- 0 ------- 1--1 0 ------- -11- 0 ------- -1-1 0 ------- --11 0 ----001 0001 1 0000001 0010 1 0001001 0100 1 0010001 1000 1 0011010 0001 1 0100010 0010 1 0101010 0100 1 0110010 1000 1 0111100 0001 1 1000100 0010 1 1001100 0100 1 1010100 1000 1 1011.e0481 2 35 6 79 * #36 6.6 .i 7.o 5.p 120010001 100000010100 100100010010 100011000001 110000100001 101000011000 100111000100 110100100100 101101000010 110010100010 101011001000 110110101000 10111.e0481 2 35 6 79 * #37 6.6 Solution #3 –RT level implementationLet’s design the portion related to the generation of the VALID output first.0481 2 35 6 79 * #38 6.6 Solution #3 –RT level implementationLet’s design the portion related to the generation of the VALID output first.VALID=1 iff:-just a 1 on C1, C2, C3, C4 &-just a 1 on R1, R2, R30481 2 35 6 79 * #39 6.6 RCJust a “1”Just a “1”Just a “1”Just a “1”VALID4 30481 2 35 6 79 * #0481 2 35 6 79 * #40 6.6 00 01 11 1000 0 1 0 101 1 0 0 011 0 0 0 010 1 0 0 0C1C2C3C4CJust a “1”Just a “1”40481 2 35 6 79 * #41 6.6 0 1 0 11 0 0 0R1 R2R300 01 11 1001RJust a “1”Just a “1”30481 2 35 6 79 * #42 6.6 Let’s now target the generation of the CODE output.0481 2 35 6 79 * #43 6.6 Let’s now target the generation of the CODE output.0481 2 35 6 79 * #0000010010000001 0010 00110101 0110 01111001 1010 101144 6.6 Let’s now target the generation of the CODE output.0481 2 35 6 79 * #0000010010000001 0010 00110101 0110 01111001 1010 101100011045 6.6 Let’s now target the generation of the CODE