Problem Set 4 Solutions

Similar documents
12/31/2010. Overview. 10-Combinational Circuit Design Text: Unit 8. Limited Fan-in. Limited Fan-in. Limited Fan-in. Limited Fan-in

Combinational Logic Design

Problem Set 9 Solutions

Working with Combinational Logic. Design example: 2x2-bit multiplier

Chapter 9. Estimating circuit speed. 9.1 Counting gate delays

VLSI Circuit Design (EEC0056) Exam

Combinational Logic (mostly review!)

Chapter # 3: Multi-Level Combinational Logic

Chapter 3 Combinational Logic Design

Computer Organization I. Lecture 13: Design of Combinational Logic Circuits

Mealy & Moore Machines

Floating Point Representation and Digital Logic. Lecture 11 CS301

Learning Objectives. Boolean Algebra. In this chapter you will learn about:

VLSI Design, Fall Logical Effort. Jacob Abraham

ECE 342 Electronic Circuits. Lecture 34 CMOS Logic

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

12/31/2010. Overview. 05-Boolean Algebra Part 3 Text: Unit 3, 7. DeMorgan s Law. Example. Example. DeMorgan s Law

Designing Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Homework 1. This homework is due September 5, 2017, at 11:59AM.

CMOS Digital Integrated Circuits Lec 10 Combinational CMOS Logic Circuits

EEC 118 Lecture #6: CMOS Logic. Rajeevan Amirtharajah University of California, Davis Jeff Parkhurst Intel Corporation

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.

Homework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker

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

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

EE371 - Advanced VLSI Circuit Design

EE 330 Lecture 6. Improved Switch-Level Model Propagation Delay Stick Diagrams Technology Files

Chapter 1: Logic systems

NTE4501 Integrated Circuit CMOS, Dual 4 Input NAND Gate, 2 Input NOR/OR Gate, 8 Input AND/NAND Gate

Digital Integrated Circuits A Design Perspective

EEC 116 Lecture #5: CMOS Logic. Rajeevan Amirtharajah Bevan Baas University of California, Davis Jeff Parkhurst Intel Corporation

Logical Effort. Sizing Transistors for Speed. Estimating Delays

Properties of CMOS Gates Snapshot

Combinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions.

EGC221: Digital Logic Lab

Overview. Programmable logic (PLAs & PALs ) Short-hand notation. Programming the wire connections

Problem Set 6 Solutions

Advanced Digital Logic Design EECS 303. Multi-level example. Two-level form. Multi-level form A B C. Multi-level logic

Combinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions

Logic Gates and Boolean Algebra

ECE429 Introduction to VLSI Design

CMSC 313 Lecture 18 Midterm Exam returned Assign Homework 3 Circuits for Addition Digital Logic Components Programmable Logic Arrays

Digital Electronics Final Examination. Part A

Possible logic functions of two variables

Motivation for Lecture. For digital design we use CMOS transistors. Gate Source. CMOS symboler. MOS transistor. Depletion. A channel is created

EE115C Digital Electronic Circuits Homework #4

EE 447 VLSI Design. Lecture 5: Logical Effort

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

EECS Variable Logic Functions

EE 434 Lecture 33. Logic Design

Digital- or Logic Circuits. Outline Logic Circuits. Logic Voltage Levels. Binary Representation

Boolean Algebra & Logic Gates. By : Ali Mustafa

EE115C Digital Electronic Circuits Homework #5

Lecture 7: Logic design. Combinational logic circuits

Contents. Chapter 3 Combinational Circuits Page 1 of 36

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic

BOOLEAN ALGEBRA INTRODUCTION SUBSETS

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

CPE/EE 427, CPE 527 VLSI Design I L06: CMOS Inverter, CMOS Logic Gates. Course Administration. CMOS Inverter: A First Look

Working with combinational logic

Combinational logic systems

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

EE 330 Lecture 39. Digital Circuits. Propagation Delay basic characterization Device Sizing (Inverter and multiple-input gates)

Electrical Circuits. Winchester College Physics. makptb. c D. Common Time man. 3rd year Revision Test

Digital Microelectronic Circuits ( ) Logical Effort. Lecture 7: Presented by: Adam Teman

Slide Set 6. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary

CMOS Inverter: CPE/EE 427, CPE 527 VLSI Design I L06: CMOS Inverter, CMOS Logic Gates. Course Administration. CMOS Properties.

Lecture 6: Logical Effort

Computer Organization: Boolean Logic

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

NAND, NOR and XOR functions properties

CSE 140 Midterm I - Solution

Very Large Scale Integration (VLSI)

Digital Electronics. Part A

Digital Integrated Circuits A Design Perspective

Week-I. Combinational Logic & Circuits

Circuits & Boolean algebra.

Implementation of Boolean Logic by Digital Circuits

Introduction to Computer Engineering. CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison

Gates and Flip-Flops

CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES

MOS SWITCHING CIRCUITS

VLSI Design I; A. Milenkovic 1

EECS 270 Midterm 2 Exam Answer Key Winter 2017

B.Supmonchai August 1st, q In-depth discussion of CMOS logic families. q Optimizing gate metrics. q High Performance circuit-design techniques

VLSI Design I; A. Milenkovic 1

CS61c: Representations of Combinational Logic Circuits

VLSI Design I; A. Milenkovic 1

CMOS logic gates. João Canas Ferreira. March University of Porto Faculty of Engineering

Chapter 2: Boolean Algebra and Logic Gates

CMOS Inverter. Performance Scaling

Unit 8A Computer Organization. Boolean Logic and Gates

CHAPTER * 6-2. a) 3-input NAND gate b) 4-input NOR gate * Pearson Education, Inc. a) F = (A + B) C D. b) G = (A + B) (C + D)

CMPEN 411. Spring Lecture 18: Static Sequential Circuits

Chapter 2 Combinational Logic Circuits

Combinational Logic. By : Ali Mustafa

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

Interconnect (2) Buffering Techniques. Logical Effort

Designing Information Devices and Systems II Spring 2016 Anant Sahai and Michel Maharbiz Homework 5. This homework is due February 29, 2016, at Noon.

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences

EE141-Fall 2011 Digital Integrated Circuits

Transcription:

SE 26 igital omputers: Organization and Logical esign Jon Turner Problem Set 4 Solutions 1. Find a minimal logic expression for the NN/NOR circuit shown below. The circuit implements the expression ((() + ) + ) = (( + + ) + ) = (+ ) = (+ ) = ( + ) = + 2. Give an equivalent N/OR circuit, corresponding to the NN/NOR circuit shown below. The circuit at left below was obtained by re-drawing the NOR gates in the alternate form. The circuit at right was obtained by cancelling redundant inversions and replacing others with inverters. - 1 -

This makes it obvious that the function implemented by this circuit is ( ), allowing us to simplify the circuit further to the one shown below. 3. How many transistors are used by original circuit in the previous problem? How many are used by the circuit in your solution? The original circuit had four NNs and NORs, plus an inverter, giving 18 transistors. The first of the two solution circuits has four N/OR gates, plus two inverters, giving 28 transistors. The final solution has 22. 4. Find a less-expensive NN/NOR equivalent for the circuit below. ompare the number of transistors used by the two circuits. The NN/NOR circuit appears at right. This circuit has 4 4+3 2=22 transistors, vs. 4 6+2 2=28 transistors for the original circuit. - 2 -

5. The and function is associative. That is ( and ) and = and ( and ). What about the nand function? Justify your answer. ased on your answer, show would you implement a nand function with 8 inputs, using just simple NN and NOR gates (that is, gates with 2 inputs) and inverters. If a NN or NOR gate has a delay of 2 and an inverter has a delay of 1, what is the worst-case propagation delay for your gate implementation? ompare the delay for your circuit to the delay for an eight input NN gate implemented directly in MOS transistors (generalize the NN3 on page 4.11 of the notes). lso, compare the transistor counts for the two circuits. The nand function is not associative, since ( nand ) nand = (() ) = +, while nand ( nand ) = (() ) = + and these are clearly not equal. The figure below shows one way to implement an eight input nand function with simple NN and NOR gates. This circuit has NOR gates in the center stage and has a delay of 6 ns. If we were to implement the NN function directly, using an eight input gate, the delay would be 8 ns (since there are eight pull-downs in series, making the falling transition four times slower than the 2 input gate). The transistor counts for the two circuits are 28 and 16 respectively, so the direct implementation is uses significantly fewer transistors at the cost of a relatively small increase in delay. - 3 -

6. Find a circuit using the minimum number of 4 input LUTs that implements the three logic equations shown below. = ( + F )( + E) Y = ( + E ) + ( + + F) = ( + E)( + F) If we let U = ( + E) = ( + E ) = ( + E), we can re-write the above expressions as = ( + F )U Y = U + ( + + F) = U( + F) Note that each of these expressions involves just four variables,,, F and U. So, we can use one LUT to implement U and three more to implement the outputs, Y and giving a total of four. The resulting circuit is E P Q R S LUT4 PQ + PQ R U F P Q R S LUT4 (P+QR )S P Q LUT4 R S S +(P Q+PQ +QR) Y P Q R S LUT4 PS(Q +P R) - 4 -

7. onsider the circuit shown below. Suppose this circuit is implemented directly, using MOS, with each N gate implemented using a NN and an inverter (similarly for OR gates). What is the worst-case delay for the circuit, assuming that NN and NOR gates have a delay of 1 ns each, and inverters have a delay of.5 ns? Highlight the path through the circuit that accounts for the worst-case delay. U V F G Y The worst-case delay is 5 ns for the highlighted path. Show an alternate implementation, using NNs, NORs and inverters that reduces the delay by at least 1.5 ns. U V F G Y This circuit has a worst-case delay of 3.5 ns from Y to F and from Y to G. - 5 -

8. onsider the circuit shown below. ssume that all gates have a minimum propagation delay (for both rising and falling edges) of 1 ns, and a maximum propagation delay of 2 ns. onstruct two timing diagrams showing how all the labeled signals change when input changes from 1 to, while inputs and are held at 1 and, respectively. In the first timing diagram, assume the minimum propagation time for all gates and in the other, assume the maximum propagation time for all gates. raw a third timing diagram which combines the first two, using shading to show the time periods where signal values could be either or 1. uncertainty region 3 6 3 6-6 -

9. esign circuits that implement the logic in the truth table shown below. esign two circuits, one which has the smallest possible worst-case propagation delay, and a second which minimizes the gate count. Use only inverters and 2-input N gates and 2-input OR gates. ssume each inverter has a propagation delay of 1 ns and each N and OR gate has a 2 ns propagation delay. When counting gates, treat an inverter as a half-gate. What are the gate counts and worst-case propagation delays for your circuits? 1 11 1 1 1 11 1 1 11 1 11 111 1 11 11 111 1 11 111 1 111 1111 1 1 11 1 1 1 1 1 1 = + + = ((+ ) + ) 1 11 1 1 11 1 1 1 1 1 1 = + + = (+)(+ + ) The first circuit shown corresponds directly to the minimum sum-of-products form of the logic expression and the second to a factorization of the sum-of-products. The first has a gate count of 9 and a worst-case propagation delay of 8 ns, while the second has a gate count of 6 and a worst-case - 7 -

propagation delay of 9 ns. However, if we cover the zeros in the K-map to obtain the product-of-sums form, we get a simpler expression, which results in the last circuit shown. This has a gate count of 6 and a worst-case propagation delay of 7 ns, so it is both smallest and fastest. 1. onsider the circuit and timing diagram shown below. ssuming that the inverters are all implemented using MOS technology the output signals and are both a single gate input, which of the two curves labeled with a question mark corresponds to the signal and which to signal? ssume that all the inverters are identical. Explain why this is true.?? The first one corresponds to signal and the second one to signal. The reason for this is that the pull-ups in the pair of inverters driving signal act like a pair of parallel resistors when the input is low. This allows them to pass twice as much current as a single resistor would, so they can pump charge into the output faster, causing the voltage to rise faster. - 8 -