Student Name: University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science

Transcription

1 University of alifornia at erkeley ollege of Engineering epartment of Electrical Engineering and omputer Science EES 5 all 2 R. H. Katz IRST MITERM EXMINTION Tuesday, 3 October 2 INSTRUTIONS RE THEM NOW! ll work is to be done on these pages. Partial credit is given only if we can evaluate your approach: indicate your assumptions and write as neatly as possible. Points are assigned to problems based on our estimates of how long they should take point equals minute. PE YOURSEL ORINGLY: it is better to get partial credit on all of the problems than to complete a handful of them. This is a closed book examination. You will not need a calculator or other information appliance. You may use a single 8.5 by piece of paper with prepared notes. Write your name and Student I Number at the top of each examination page. Please refrain from discussing the examination after you have taken it. small number of students are taking a late examination due to special circumstances. It is a sad fact of life that cheating sometimes happens. It will not be tolerated. y signing below, you assert that all of the work included herein is your own, and that you understand the harsh penalties that will be imposed should cheating be detected a on the examination, and a letter of reprimand to your file: (Signature) (Name Please Print!) QUESTION POINTS SSIGNE POINTS OTINE TOTL 9 S 5 Midterm # Page 3 October 2; 2:-3:3 PM

2 Question. Terminology (i) Prime Implicants (5 Points): In a 3-variable K-map, show a function and its prime implicants that illustrates the fact that there is more than one equally good minimized Sum of Products realizations of the function. (a) ill in the K-map for (,,) below. (b) Identify the prime implicants by suitable circlings. (c) Select two different covers from the prime implicants, each with the same number of product terms and literals. irst minimized implementation of (,,) = Second minimized implementation of (,,) = (ii) Product of Sums versus Sums of Products (5 Points): Give a K-map and an example function whose minimized PoS form has fewer literals in it than its minimized SoP form. (a) ill in the K-map for (,,) below. (b) Indicate the minimized SoP and PoS realizations you obtain. (c) How many literals is in each realization? Minimized SoP realization of (,,) = Number of literals is: Minimized PoS realization of (,,) = Number of literals is: S 5 Midterm # Page 2 3 October 2; 2:-3:3 PM

3 Question 2. Minimization (5 Points) Given the following four four-variable functions: W(,,,) = Sm(,2,4,5,8,,2,3) X(,,,) = Sm(,2,5,7,3,5) Y(,,,) = Sm(4,5,6,8,,2,3,4) Z(,,,) = Sm(5,6,7,8,,3,4,5) Use K-maps to independently minimize the functions in Sum of Products form. W X Y Z W = X = Y = Z = The number of unique product terms is: Now resolve for W, X, Y, Z when the target of implementation is a Programmable Logic rray (PL): W = X = Y = Z = The number of unique product terms is: S 5 Midterm # Page 3 3 October 2; 2:-3:3 PM

4 Question 3. Minimization (2 Points) onsider the following function: (,,,) = Sm(,5,6,9,2,5) (a) What is the minimized Sum of Products form? How many literals does it have? = Literal ount is (b) What is the minimized Product of Sums form? How many literals does it have? (c) In addition to N, OR, omplement (NOT) functions, assume that you can also use the XOR function as a primitive gate. They cost no more to use than simple gates like N and OR. How do you obtain an implementation with a minimized literal count now? Write down your answer as a twolevel oolean expression using XOR, N, OR, NOT functions. = = Literal ount is Literal ount is Show your work below: S 5 Midterm # Page 4 3 October 2; 2:-3:3 PM

5 Question 4. ircuits with eedback (5 points) onsider the following circuit schematic and timing waveform. ssume that all gates have identical gate delays. Each time division in the waveform diagram represents a gate delay. t time T, the switch has been open long enough for the signals to have reached a steady initial state. t T, the switch closes. ill in the waveform diagram. E T T TIME What kind of periodic signal does this circuit generate? S 5 Midterm # Page 5 3 October 2; 2:-3:3 PM

6 Question 5. Multiplexer esign (5 Points) esign a subsystem using multiplexer components that can do the following function: ata Inputs:,,, ontrol Inputs: S, S Outputs: W, X, Y, Z The behavior of the system is described by the following functional truth table: Rotate Inputs Right Rotate Inputs Left rithmetic Shift Inputs Right rithmetic Shift Inputs Left raw a wiring diagram for your implementation below: S S W X Y Z S S 2 3 S S 2 3 S S 2 3 S S 2 3 S 5 Midterm # Page 6 3 October 2; 2:-3:3 PM

7 Question 6. Multiplexer Implementation (5 Points) Given the five variable function (,,,,E) = Sm(,,3,4,8,9,,,2,4,6,2,2,23,26,3), show how to implement this using a single 8: multiplexer and no other logic gates (you may assume that variables and their complements are available at no cost to your implementation). HINT: Use,, E as the multiplexer control inputs. Show the wiring below: S2 S S Show your approach below: S 5 Midterm # Page 7 3 October 2; 2:-3:3 PM

8 Question 7. esign Problem ( Points) It is well known from the X-iles that liens have two arms and three fingers on each hand. So it is not so surprising that they have a base 6 number system. esign a digital subsystem that takes as input a binary coded hexary (H) digit (i.e., through 5 is represented by the binary numbers through ) and a mode input that outputs the H digit plus when mode = and H when mode =. (a) Identify your inputs and outputs. raw a block diagram: H Increment/ ecrement y (b) State your assumptions about the behavior of the circuit. ocument your understanding of the function with a truth table: (c) Implement it in minimized Sum of Products form. raw filled in K-maps, circled implicants, and the minimized oolean equations for your outputs: S 5 Midterm # Page 8 3 October 2; 2:-3:3 PM