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

Similar documents
EECS 312: Digital Integrated Circuits Midterm Exam 2 December 2010

EECS 312: Digital Integrated Circuits Midterm Exam Solutions 12 March 2009

EECS 312: Digital Integrated Circuits Midterm Exam 2 December 2010

ESE570 Spring University of Pennsylvania Department of Electrical and System Engineering Digital Integrated Cicruits AND VLSI Fundamentals

Digital Integrated Circuits A Design Perspective. Semiconductor. Memories. Memories

Digital Integrated Circuits A Design Perspective

Semiconductor Memories

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

EECS 141: SPRING 09 MIDTERM 2

Lecture 25. Semiconductor Memories. Issues in Memory

EE371 - Advanced VLSI Circuit Design

Semiconductor Memories

EE371 - Advanced VLSI Circuit Design

Hw 6 and 7 Graded and available Project Phase 2 Graded Project Phase 3 Launch Today

Semiconductor Memory Classification

ESE570 Spring University of Pennsylvania Department of Electrical and System Engineering Digital Integrated Cicruits AND VLSI Fundamentals

and V DS V GS V T (the saturation region) I DS = k 2 (V GS V T )2 (1+ V DS )

Homework Assignment #5 EE 477 Spring 2017 Professor Parker

Name: Answers. Mean: 83, Standard Deviation: 12 Q1 Q2 Q3 Q4 Q5 Q6 Total. ESE370 Fall 2015

University of Toronto. Final Exam

CARNEGIE MELLON UNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING DIGITAL INTEGRATED CIRCUITS FALL 2002

SEMICONDUCTOR MEMORIES

CMOS Digital Integrated Circuits Lec 13 Semiconductor Memories

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

GMU, ECE 680 Physical VLSI Design 1

ESE570 Spring University of Pennsylvania Department of Electrical and System Engineering Digital Integrated Cicruits AND VLSI Fundamentals

EE115C Digital Electronic Circuits Homework #6

Magnetic core memory (1951) cm 2 ( bit)

C.K. Ken Yang UCLA Courtesy of MAH EE 215B

Lecture 16: Circuit Pitfalls

EE141- Fall 2002 Lecture 27. Memory EE141. Announcements. We finished all the labs No homework this week Projects are due next Tuesday 9am EE141

Semiconductor memories

EE141Microelettronica. CMOS Logic

Digital Integrated Circuits A Design Perspective

CPE100: Digital Logic Design I

CSE 140 Midterm 2 Tajana Simunic Rosing. Spring 2008

Objective and Outline. Acknowledgement. Objective: Power Components. Outline: 1) Acknowledgements. Section 4: Power Components

ESE 570: Digital Integrated Circuits and VLSI Fundamentals

Topics. Dynamic CMOS Sequential Design Memory and Control. John A. Chandy Dept. of Electrical and Computer Engineering University of Connecticut

Floating Point Representation and Digital Logic. Lecture 11 CS301

EECS 151/251A Homework 5

VLSI Design, Fall Logical Effort. Jacob Abraham

CSE 140 Midterm 3 version A Tajana Simunic Rosing Spring 2015

9/18/2008 GMU, ECE 680 Physical VLSI Design

EE241 - Spring 2001 Advanced Digital Integrated Circuits

CSE140: Components and Design Techniques for Digital Systems. Logic minimization algorithm summary. Instructor: Mohsen Imani UC San Diego

UNIVERSITY OF WISCONSIN MADISON

EE 466/586 VLSI Design. Partha Pande School of EECS Washington State University

EECS 270 Midterm 2 Exam Answer Key Winter 2017

Name: Grade: Q1 Q2 Q3 Q4 Q5 Total. ESE370 Fall 2015

EE 209 Logic Cumulative Exam Name:

Adders, subtractors comparators, multipliers and other ALU elements

Chapter 9. Estimating circuit speed. 9.1 Counting gate delays

EECS 141: FALL 05 MIDTERM 1

Interconnects. Wire Resistance Wire Capacitance Wire RC Delay Crosstalk Wire Engineering Repeaters. ECE 261 James Morizio 1

EECS 427 Lecture 8: Adders Readings: EECS 427 F09 Lecture 8 1. Reminders. HW3 project initial proposal: due Wednesday 10/7

Topics. CMOS Design Multi-input delay analysis. John A. Chandy Dept. of Electrical and Computer Engineering University of Connecticut

UNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences. Professor Oldham Fall 1999

LECTURE 28. Analyzing digital computation at a very low level! The Latch Pipelined Datapath Control Signals Concept of State

EE115C Digital Electronic Circuits Homework #4

Lecture 7: Logic design. Combinational logic circuits

Circuit A. Circuit B

VLSI Design. [Adapted from Rabaey s Digital Integrated Circuits, 2002, J. Rabaey et al.] ECE 4121 VLSI DEsign.1

Digital Integrated Circuits EECS 312

Adders, subtractors comparators, multipliers and other ALU elements

EECS 270 Midterm Exam 2 Fall 2009

Chapter 5 CMOS Logic Gate Design

Bit-Sliced Design. EECS 141 F01 Arithmetic Circuits. A Generic Digital Processor. Full-Adder. The Binary Adder

Digital Integrated Circuits Lecture 14: CAMs, ROMs, and PLAs

Semiconductor Memories

Very Large Scale Integration (VLSI)

VLSI Circuit Design (EEC0056) Exam

S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques

Semiconductor Memories

Georgia Institute of Technology School of Electrical and Computer Engineering. Midterm-1 Exam (Solution)

MODULE 5 Chapter 7. Clocked Storage Elements

E40M Capacitors. M. Horowitz, J. Plummer, R. Howe

Lecture 6 Power Zhuo Feng. Z. Feng MTU EE4800 CMOS Digital IC Design & Analysis 2010

PAST EXAM PAPER & MEMO N3 ABOUT THE QUESTION PAPERS:

Simulation of Logic Primitives and Dynamic D-latch with Verilog-XL

CMPEN 411 VLSI Digital Circuits Spring Lecture 19: Adder Design

Interconnect (2) Buffering Techniques. Logical Effort

! Memory. " RAM Memory. ! Cell size accounts for most of memory array size. ! 6T SRAM Cell. " Used in most commercial chips

6.012 Electronic Devices and Circuits Spring 2005

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

Digital Integrated Circuits Designing Combinational Logic Circuits. Fuyuzhuo

CMOS Inverter. Performance Scaling

Dynamic Combinational Circuits. Dynamic Logic

ECE 407 Computer Aided Design for Electronic Systems. Simulation. Instructor: Maria K. Michael. Overview

E40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1

S No. Questions Bloom s Taxonomy Level UNIT-I

Boolean Logic Continued Prof. James L. Frankel Harvard University

UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer Sciences

ESE 570: Digital Integrated Circuits and VLSI Fundamentals

Memory Trend. Memory Architectures The Memory Core Periphery

Digital Integrated Circuits A Design Perspective

Interconnects. Introduction

Review for Final Exam

EE241 - Spring 2000 Advanced Digital Integrated Circuits. Announcements

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

Transcription:

Signature: EECS 312: Digital Integrated Circuits Final Exam Solutions 23 April 2009 Robert Dick Show your work. Derivations are required for credit; end results are insufficient. Closed book. You may use a calculator. Honor Pledge: I have neither given nor received aid in this exam. 1. (10 pts.) k n = W µnɛox Lt ox When the move from SiO 2 to high-κ gate dielectric occurred, what qualitative changes were made to the variables upon which k n depends? You may assume that k n remains fixed. Use only a few sentence fragments for your answer. ɛ ox, t ox. Note: If you didn t get this one, please read the Spectrum article and the midterm solutions. 2. (10 pts.) Consider the following circuit: CLK Q CLK Q 1d CLK Q 1d 7d 7d 7d 7d The numbers near the logic gates indicate delays. Disconnected logic gate inputs may be assumed to be stable. Draw the gate- and latch-level diagram of a two-phase latch-based reimplementation of this circuit and indicate the minimal safe clock period. Do not change anything but the positions of the latches. You may neglect latch delays. CLK C Q C Q C Q 7d 7d 1d C Q Q CLK CLK CLK 7d CLK 7d CLK The clock period must clearly be greater than Given that n 1 p = 2 d i /n = 10d. i=0 φ i+1 = φ i p/2 + d i, we can compute the phase each stage: C C Q 1d φ 0 = 2d, φ 1 = 4d, φ 2 = 0d, φ 3 = 2d, φ 4 = 4d, φ 5 = 0d.

max i=0 n 1φ i min i=0 n 1φ i = 4d 0d = 4d 4d < p/2(5d) so the minimal period of 10d is valid. 3. (10 pts.) Indicate two ways of programming floating-gate transistors and two ways of erasing floating-gate transistors. It is fine for the methods to require slightly different floating gate transistor designs. Use at most four short phrases. Programming Fowler-Nordheim tunneling from source or drain to floating gate or Avalanche injection of hot carriers accelerated between source and drain. Erasing Exposure to ultraviolet light, the photons of which impart enough energy to charge carriers in the floating gate to overcome the energy barrier separating the floating gate from other nodes or Fowler-Nordheim tunneling from the gate to source or drain. 4. (10 pts.) Draw the transistor-level diagram for a sense amplifier that reprograms the read value. Your circuit should have the following inputs: read program, equalize, bit, and bit. You may not assume access to complemented input literals. See the textbook s diagram of a DRAM sense amplifier. An additional inverter is necessary to invert the read program signal used to control the PMOSFET in series with the amplifier. 5. (10 pts.) Draw a gate-level diagram for a three-bit carry-lookahead adder. Correctness counts the most, but efficiency also counts. You may use hierarchy. In other words, once you show how to construct something more complex than a standard logic gate, you can assign a symbol to it and reuse that symbol. p i = a i b i g i = a i b i s i = a i b i ci i co i not used ci 0 = 0 ci 1 = g 0 ci 2 = g 1 + p 1 g 0 = g 1 p 1 g 0 ci 2 = g 2 + p 2 (g 1 + p 1 g 0 ) = g 2 + p 2 g 1 + p 2 p 1 g 0 = g 2 p 2 g 1 p 2 p 1 g 0 The schematics are straight-forward, and are left as an exercise to the reader. You can verify your results using the textbook.

6. (10 pts.) Use the concept of logical effort to size the gates in the following circuit to minimize the delay for path A B. A 1C B 10C VSS You need not round your sizes. F = BGH 7/3 + 4/3 B = = 11 7/3 7 = 1.57 G = 1 7 4 4 3 3 3 = 4.15 H = 10C/C = 10 F = 65.16 ˆf = 4 65.16 = 2.84 ĥ i = ˆf/g i ĥ 4 = 2.13 ĥ 3 = 2.13 ĥ 2 = 1.22 ĥ 1 = 2.84 h i = Cout i /Cin i Cin i = Cout i /h i Cin ˆ i = Cout ˆ i /ĥi Cin ˆ 4 = 10C/2.13 = 4.69C Cin ˆ 3 = 4.69C/2.13 = 2.20C Cin ˆ 2 = 2.20C/1.22 = 1.80C Cin ˆ 1.80C + 1.80C 4/7 1 = = 1.00C 2.84 7. (10 pts.) Draw a transistor-level diagram of a 3:8 decoder in which the transistors are sized to achieve the same output resistance to ground and V DD as an inverter with gate capacitance 3C. This is a set of three-input NOR gates in which the PMOSFETs have

gate capacitances of 6C and the NMOSFETs have gate capacitances of C. You may assume access to complemented input literals, but no credit will be taken off for those who include inverters in their designs. 8. (10 pts.) Draw the gate-level diagram of a rising edge triggered scan-flop, i.e., a flip-flop that can be used to support normal operation and scan-chain testing. You may use transistors in addition to logic gates. If sizing is essential for correct operation, label the appropriate gates and/or transistors as narrow and wide. combinational scan chain 2:1 MUX clk D Q test/operate Instead of showing all the possible designs of the D flip-flop and 2:1 MUX, the reader can refer to the textbook. 9. (10 pts.) Determine the worst-case delay from precharge disable to output transition for a single-bit cell in a four-word MOS NAND ROM. λ =125 nm. All gates are 2λ long and 4λ wide. Sources and drains are 3λ long and 4λ wide. Assume (1) a default 0.25 µm process, (2) all inputs experiences a perfect step voltage change, and (3) an output capacitance of 10 ff. See Figure 12-13 on page 639 in the textbook (Rabaey et. al) for the NAND ROM schematic. We replace the grounded PMOS inputs with a precharge PMOS and add an NMOS footer below the NMOS stack. Note that if one assumes that the wordline inputs change before the end of the precharge period, the footer is not necessary. Assume that bits 0-2 store logic 1 values and bit 3 stores a logic 0 value. The worst case delay will occur when reading bit 3, because the output must discharge through the three NMOS controlled by wordlines 0 2 and the footer. Assume that bit 3 is implemented by a wire, as shown in Figure 12-13 in the book. We compute the Elmore delay of the equivalent RC network. Note that when determining the capacitances, due to the step function (i.e., instantaneous) inputs we include only the diffusion caps and not gate caps. Many of the diffusion caps will only charge to V dd V th during precharge, but for Elmore delay calculations we assume they charge to the full V dd. This will result in acceptable error. The source and drain caps are given by Equation 3.45 on page 111 in the textbook. The PMOS drain cap is 0.631 ff. The NMOS source and drain caps are 0.725 ff. The NMOS equivalent resistance 6.5 kω.

Thus, the Elmore delay is given by 11.36f (4 6.5k) + 1.45f (3 6.5k) + 1.45f (2 6.5k) + 1.45f (6.5k) which equals 0.35 ns.