EECS 270 Midterm Exam 2 Fall 2009

Similar documents
EECS 270 Midterm 2 Exam Answer Key Winter 2017

CSE 140 Midterm 2 Tajana Simunic Rosing. Spring 2008

The Design Procedure. Output Equation Determination - Derive output equations from the state table

EE 209 Logic Cumulative Exam Name:

CSE 140 Midterm 3 version A Tajana Simunic Rosing Spring 2015

UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department

Parity Checker Example. EECS150 - Digital Design Lecture 9 - Finite State Machines 1. Formal Design Process. Formal Design Process

Lecture 10: Synchronous Sequential Circuits Design

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences

Problem Set 9 Solutions

3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value

Final Exam. ECE 25, Spring 2008 Thursday, June 12, Problem Points Score Total 90

CPE100: Digital Logic Design I

CPE100: Digital Logic Design I

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

Appendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs

Dr. Nicola Nicolici COE/EE2DI4 Midterm Test #2 Nov 22, 2006

Exam for Physics 4051, October 31, 2008

11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output of

Practice Final Exam Solutions

04. What is the Mod number of the counter circuit shown below? Assume initially reset.

Synchronous Sequential Circuit Design. Digital Computer Design


Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

FSM model for sequential circuits

CSE140: Components and Design Techniques for Digital Systems. Midterm Information. Instructor: Mohsen Imani. Sources: TSR, Katz, Boriello & Vahid

Counters. We ll look at different kinds of counters and discuss how to build them

CSC 322: Computer Organization Lab

University of Minnesota Department of Electrical and Computer Engineering

Contents. Chapter 3 Combinational Circuits Page 1 of 36

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

WORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of

Sequential logic and design

Design of Sequential Circuits

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

University of Florida EEL 3701 Fall 2014 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Wednesday, 15 October 2014

Review for Final Exam

EEE2135 Digital Logic Design

Review Problem 1. should be on. door state, false if light should be on when a door is open. v Describe when the dome/interior light of the car

DE58/DC58 LOGIC DESIGN DEC 2014

UNIVERSITY OF WISCONSIN MADISON

Written exam with solutions IE Digital Design Friday 21/

Let s now begin to formalize our analysis of sequential machines Powerful methods for designing machines for System control Pattern recognition Etc.

EECS 312: Digital Integrated Circuits Final Exam Solutions 23 April 2009

EECS150 - Digital Design Lecture 23 - FSMs & Counters

Different encodings generate different circuits

( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function

CSE 140 Midterm 2 - Solutions Prof. Tajana Simunic Rosing Spring 2013

ELCT201: DIGITAL LOGIC DESIGN

EECS150 - Digital Design Lecture 21 - Design Blocks

Preparation of Examination Questions and Exercises: Solutions

Introduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010

ENEL Digital Circuit Design. Final Examination

CprE 281: Digital Logic

Synchronous Sequential Logic

Computer Science Final Examination Friday December 14 th 2001

Chapter 5. Digital systems. 5.1 Boolean algebra Negation, conjunction and disjunction

Fundamentals of Digital Design

Adders, subtractors comparators, multipliers and other ALU elements

EECS150 - Digital Design Lecture 11 - Shifters & Counters. Register Summary

Read this before starting!

Digital Design. Sequential Logic

For smaller NRE cost For faster time to market For smaller high-volume manufacturing cost For higher performance

ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks

CprE 281: Digital Logic

ECE/Comp Sci 352 Digital Systems Fundamentals. Charles R. Kime Section 2 Fall Logic and Computer Design Fundamentals

EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates

BER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO

EECS Components and Design Techniques for Digital Systems. FSMs 9/11/2007

ENGR4300 Fall 2005 Test 3A. Name. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)

Total Time = 90 Minutes, Total Marks = 100. Total /10 /25 /20 /10 /15 /20

We are here. Assembly Language. Processors Arithmetic Logic Units. Finite State Machines. Circuits Gates. Transistors

Time Allowed 3:00 hrs. April, pages

Faculty of Engineering. FINAL EXAMINATION FALL 2008 (December2008) ANSWER KEY

Latches. October 13, 2003 Latches 1

Sequential Logic Circuits

University of Toronto Faculty of Applied Science and Engineering Final Examination

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring

University of Florida EEL 3701 Summer 2015 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Tuesday, 30 June 2015

PG - TRB UNIT-X- DIGITAL ELECTRONICS. POLYTECHNIC-TRB MATERIALS

ALU, Latches and Flip-Flops

Synchronous Sequential Circuit

EE371 - Advanced VLSI Circuit Design

Mealy & Moore Machines

CS61C : Machine Structures

Vidyalankar. S.E. Sem. III [EXTC] Digital System Design. Q.1 Solve following : [20] Q.1(a) Explain the following decimals in gray code form

Digital Logic Design - Chapter 4

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS

Read this before starting!

Hakim Weatherspoon CS 3410 Computer Science Cornell University

Spiral 2-1. Datapath Components: Counters Adders Design Example: Crosswalk Controller

Total time is: 1 setup, 2 AND, 3 XOR, 1 delay = (1*1) + (2*2) + (3*3) + (1*1) = 15ns

Logic and Computer Design Fundamentals. Chapter 8 Sequencing and Control

Design at the Register Transfer Level

EECS150 - Digital Design Lecture 16 Counters. Announcements

CS61C : Machine Structures

Transcription:

EECS 270 Midterm Exam 2 Fall 2009 Name: unique name: UMID: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. Scores: NOTES: Problem # Points 1&2 /11 3 /9 4 /7 5 /7 6 /7 7 /10 8 /8 9 /8 10 /10 11 /6 12 /17 Total /100 1. Open book and Open notes 2. There are 13 pages total. Count them to be sure you have them all. 3. Calculators are allowed, but no PDAs, Portables, Cell phones, etc. 4. This exam is fairly long: don t spend too much time on any one problem. 5. You have about 120 minutes for the exam. 6. Be sure to show work and explain what you ve done when asked to do so. Page 1 of 13

1. Multiple choice /fill in the blank. Circle the correct answer or fill in the blank. [7 points, -2 per wrong or blank answer, minimum 0] A single bit of SRAM/DRAM/ROM consists of a transistor and a capacitor. In a 32 by 32 memory array, if the output is to be 4 bit per address, you need address lines total, of which will go to the row decoder. In base-2 arithmetic, if you clear all but the four least-significant digits you are: subtracting / dividing by / adding / multiplying by /taking the modulo by the number. 123 base 4 is in base 2 representation. 2. Two 16-bit counters are connected as follows. Assume that these two counters are both working as "counting up" (note that 7 is the MSB for the output of a counter); also, the period of the input clock signal for the 1st counter (the one on the left-hand side) is equal to 1 μs. Calculate the frequency of the output signals at A and B, respectively. Be sure to include units! [4 points] 1μs clock 8-bit up counter 0 1 2 3 4 5 6 7 A 8-bit up counter 0 1 2 3 4 5 6 7 B Frequency of A: Frequency of B: Page 2 of 13

3. For the following problem indicate if each statement is true, false or unknown if true or false by writing a T, F or U as appropriate. [9 points, -2 for each wrong or blank answer, minimum 0] If wxy is a prime implicant of the function F(w,x,y,z) then a. wxy z is an implicant of F. b. wxyz is an implicant of F. c. wy is an implicant of F. d. wz is an implicant of F. e. if xy z and wz are prime implicants of F then wxy is an essential prime implicant. f. if the only other prime implicants of F are y z and w x y then wxy is an essential prime implicant. Page 3 of 13

4. Find the minimal product-of-sums for the following function F= W,X,Y,Z (0,2,3,6,8,9,12)+d(1,11,13). Use a K-map and clearly show your work. [7 points] Page 4 of 13

5. For this problem you will be designing a serial comparator. This device will take two numbers as input, with one bit of each number being provided each cycle (most significant bit first). It is then to figure which value is the greater one. More formally: The machine has three inputs (X, Y and reset) and one output (Z) in addition to the clock. If the reset input is a 1, the output should be 0, otherwise the output will be determined by X and Y. The X and Y inputs are binary numbers given one bit at a time with the most significant bit given first and are valid on the rising edge of the clock (as well as well before and after that edge.) The output Z is to be 1 if the bits of X seen so far are larger (as a binary number) than the bits of Y seen so far (since reset last went low). Consider the sample input and output sequence below (note: the leftmost bits are the oldest!): X 01010 Serial Z Comparator 01111 00011 Y In this figure first X and Y are both zero, so X is not greater than Y and therefore Z=0. On the next rising edge of the clock X is now 1 (for a running value of 01) and Y is 0 (for a running value of 00) so the running value of X is greater than the running value of Y and therefore Z=1. Design a Moore-type state diagram which solves this problem. To receive more than half credit you must use as few states as possible. [7 points] Page 5 of 13

6. Complete the timing diagram for the state machine shown below. For the state, simply write the state name. [7 points] All outputs are zero Unless shown A/Y=1 A/Y=1,Z=1 Input is A Outputs are Y and Z R!A/Y=1 S!A/Z=1 T A/!A/Y=1 A State R Y Z Page 6 of 13

7. For this problem, assign state bits S[1:0] as 00 for state R, 01 for state S, and 10 for state T. Using a K-map, find the minimal sum-of-products for next state (NS[1:0]) and the outputs (Y and Z). You are to assume that any output not shown is zero and that you will never reach the state S[1:0]=11, so you don t care what happens in that case. You must show your work to get any credit! [10 points] All outputs are zero Unless shown A/Y=1 A/Y=1,Z=1 Input is A Outputs are Y and Z R!A/Y=1 S!A/Z=1 T A/!A/Y=1 NS1= NS0= Y= Z= Page 7 of 13

8. Say you have the following values associated with the process you are using: Device Min Max DFF: to 1ns 4ns Set-up time 4ns Hold time 5ns OR/AND 2ns 6ns NOT 1ns 3ns NAND/NOR 1ns 5ns XOR 3ns 7ns A D 0 CLK D 1 CLK X CLK Assume that the input A is coming from a flip-flop that has the same properties as the flip-flops that are shown and is clocked by the same clock. a. Add inverter pairs as needed to the above figure to avoid any fast path problems. Do so in a way that has least impact on the worst-case delay (as a first priority) and which keeps the number of inverter pairs needed to a minimum (as a second priority). [3 points] b. After you ve made your changes in part a, compute the maximum frequency at which this device can be safely clocked. Clearly show your work. [5 points] Page 8 of 13

9. Draw the state transition diagram which is implemented by the following circuit. [8 points] A D 0 CLK D 1 CLK Z CLK Page 9 of 13

10. Design a Mealy-type state transition diagram for the following problem. There are 2 inputs, X and Y, and one two-bit output M[1:0]. You are to output ((# of 1 s in X since reset)+(# of 0 s in Y since reset))mod 3 The mod 3 simply means to return the remainder when divided by 3. So if there had been 2 ones in X and 5 zeros in Y since reset the output would be one, or M[1:0]=01. The table below shows an example set of inputs and outputs. Just to be helpful, the value (# of 1 s in X since reset)+(# of 0 s in Y since reset) is listed under sum in the table. [10 points] X 0 0 1 0 1 0 1 0 1 Y 1 0 1 1 0 0 1 1 0 Sum 0 1 2 2 4 5 6 6 8 M1 0 0 1 1 0 1 0 0 1 M0 0 1 0 0 1 0 0 0 0 Be very sure that: You have clearly labeled your inputs and outputs on the machine. You have indicated which state to start in Your answer is readable. Page 10 of 13

11. Using only 2 T-flip flops and no more than 2 standard gates (AND, NAND, NOT, XOR etc.) design a 2-bit up/down counter. The device is to count up when up/down is a 1 and down when up/down is a 0. C1 is the MSB. [6 points] 2-bit up/down counter up/down clock C0 C1 Page 11 of 13

DE DATA DOUT AOE BOE 1E 0E RA LA Reg A Reset Load RB LB 12. You are to design a state machine which causes the above datapath to find the average of 4 numbers (rounding down). When the START signal goes high, you are to begin to compute the average. Once done, the result should be placed on DOUT and the DONE signal should be set high. START will not go high again until after DONE is asserted. The data to be averaged is available on DATA. The first element will be there when START is high. Each successive data element will be placed on DATA after any rising edge where the NEXT signal is asserted. A) Consider the diagram found below. For each entry in the table, indicate where in the diagram it belongs by placing exactly one of U,V,W,X,Y or Z next to the table entry. [4 points] U Controller Reg B Reset Load W X V ina Datapath inb ALU cmd out ALUC 1 0 Other inputs and outputs NEXT Causes DATA to change to the next data element on the next rising edge of the clock. DONE Indicates the result is available on DOUT. Only needs to be asserted for one clock period. START You are to start finding the average. B4 True if RegB==4 B8 True if RegB==8 ALU cmd Operation 0 out=ina+inb 1 out=ina-inb 2 out=ina<<inb 3 out=ina>>inb Note X>>Y means to shift X Y places to the right Y Z DATA: AOE: B4: START: ALUC: DOUT: (Problem continues on next page). Page 12 of 13

DE DATA DOUT AOE BOE 1E 0E RA LA Reg A Reset Load RB LB Reg B Reset Load B) Draw a Moore-type state diagram which causes the datapath to perform the specified function. Any value not specified in a given state will be assumed to be zero. You may assume there will be no problems with overflow. [13 points] ina inb ALU cmd out ALUC 1 0 Other inputs and outputs NEXT Causes DATA to change to the next data element on the next rising edge of the clock. DONE Indicates the result is available on DOUT. START You are to start finding the average. B4 True if RegB==4 B8 True if RegB==8 ALU cnt Operation 0 out=ina+inb 1 out=ina-inb 2 out=ina<<inb 3 out=ina>>inb Note X>>Y means to shift X Y places to the right Page 13 of 13