Advanced Digital Logic Design EECS 303. Multi-level example. Two-level form. Multi-level form A B C. Multi-level logic
|
|
- Stuart Cobb
- 5 years ago
- Views:
Transcription
1 dvanced igital Logic esign S 33 Multi-level example Teacher: Robert ick Office: L477 Tech mail: dickrp@northwestern.edu Phone: So far, we have talked about two-level logic ewest number of levels that is fully general However, there are some circuits that can more efficiently be implemented using three or more levels ven basic functions, like NNS and NORS, are commonly composed of multiple gates if the fan-in is high 4 Robert ick dvanced igital Logic esign Two-level form Two-level form X(,,,,,, G) = G x 5 6 G 5 Robert ick dvanced igital Logic esign x 5 6 G 6 x 3-input N gates x 7-input OR gate (may not exist!) 25 wires (9 literals plus 6 internal wires) 6 Robert ick dvanced igital Logic esign Multi-level form Multi-level form actor: G X(,,,,,,G) = G = ( + + )( + ) + G 4 x G 2 3 x 3-input OR gate, 2 x 2-input OR gates x 3-input N gate wires (7 literals plus 3 internal wires) 4 x 7 Robert ick dvanced igital Logic esign 8 Robert ick dvanced igital Logic esign Multi-level implementation of NN8 Multi-level logic = ( + ) + Level Level 2 Level 3 Level 4 Orig inal N OR Netwo rk \ G Introduction and ons ervation of ubbles \ G onvert middle Ns to NORs with inverted inputs Redrawn in terms of conventional NN Gates \ \ G 9 Robert ick dvanced igital Logic esign Robert ick dvanced igital Logic esign
2 Multi-level logic NN/NOR conversion for uneven paths Level Level 2 Level 3 Level 4 \ G Same beginning netwo rk after introduction of bubbles X Orig inal circuit X X dd double bubbles at inputs \ \ \ \ G inal netwo rk, redrawn in NOR only fo rm \X \ \ is tribute bubbles s ome mis matches \X Ins ert inverters to fix mis matches Robert ick dvanced igital Logic esign 2 Robert ick dvanced igital Logic esign Multi-level minimization objectives Multi-level minimization actor out common sub-logic (reduce fan-in, increase gate levels), subject to timing constraints Map factored form onto library of gates Minimize number of literals (correlates with number of wires) X = ( + )( + ( + )) + ( + )(G) an interactively apply the following operations ecomposition xtraction actoring Substitution ollapsing 4 Robert ick dvanced igital Logic esign 5 Robert ick dvanced igital Logic esign Multi-level minimization ecomposition Recall that two-level minimization is difficult Quine-Mcluskey is too slow for large problems Resort to potentially sub-optimal heuristic spresso Multi-level minimization is much harder No known efficient algorithm gives optimal solution MIS uses heuristics to usually produce good solutions Take a single oolean expression and replace it with a collection of new expressions L rewritten as L = L = MN + M N M = N = + 2 literals 8 literals 6 Robert ick dvanced igital Logic esign 7 Robert ick dvanced igital Logic esign ecomposition ecomposition L = = ( + ) + ( + ) = ( + ) + ()( + ) M = N = + L = MN + M N efo re ecompos ition fter ecompos ition 8 Robert ick dvanced igital Logic esign 9 Robert ick dvanced igital Logic esign
3 xtraction xtraction xtraction is decomposition applied to multiple functions The best decomposition for a single function may not be the best if there are multiple outputs Ideally, extracted sub-function can be re-used in producing many outputs L = ( + ) + M = ( + ) N = an be re-written as L = XY + M = X N = Y X = + Y = literals literals 2 Robert ick dvanced igital Logic esign 2 Robert ick dvanced igital Logic esign xtraction xtraction example X L Y M N efo re xtraction fter xtraction Gate count has improved, literals is unchanged L M N Given equations of a oolean Network L = + + G + G literals M = N = + ind the best kernel of these functions. If the kernel is ( + ), then L = M + P + G + G 22 literals M = P + P N = + P = + 22 Robert ick dvanced igital Logic esign 23 Robert ick dvanced igital Logic esign ube extraction actoring an restrict divisors to single cubes L = + + G 6 literals M = G N = + We can obtain the best cube to divide the functions L = P + P + G 5 literals M = PG N = + P = xpression in two-level form re-expressed in multi-level form without introducing intermediate functions an be rewritten as L = L = ( + )( + ) + 9 literals 5 literals 24 Robert ick dvanced igital Logic esign 25 Robert ick dvanced igital Logic esign actoring Substitution xpress L in terms of M L = + M = + L rewritten in terms of M L = M( + ) M = + 5 literals 5 literals efo re acto ring fter actoring 26 Robert ick dvanced igital Logic esign 27 Robert ick dvanced igital Logic esign
4 ollapsing Redundancy Reverse of substitution. Sometimes eliminates levels to meet timing constraints. L = M( + ) M = + L = ( + )( + ) = = + 5 literals only 2 additional Minimizing gate count and literals isn t always good for performance or power consumption Using redundant sub-circuits can result in improvements The wiring required to re-use sub-functions can result in larger delays than redundant sub-functions 28 Robert ick dvanced igital Logic esign 29 Robert ick dvanced igital Logic esign oolean division oolean division L = PQ + R P divisor Q quotient R remainder X = Y = + X divided by Y expressed as X = Y ( + ) + P and Q are symmetrical inding divisors that lead greatest number of common subexpressions is difficult L = + + M = + M does not divide L under algebraic division rules M does divide L under oolean rules (very large number of these!) L/M = ( + ) 3 Robert ick dvanced igital Logic esign 3 Robert ick dvanced igital Logic esign oolean division oolean division L = + + M = + L = ( + )( + ) + = ( + )( + ) + This follows from writing L in MQ + R form L = M(( + )) + = ( + )( + ) + = ( ) + = ( + ) + = Robert ick dvanced igital Logic esign 33 Robert ick dvanced igital Logic esign Multi-level minimization definitions Multi-level minimization definitions variable is a symbol representing a single coordinate in a oolean space, e.g., or Literal is a variable or its negation, e.g., or cube,, is a set of literals, e.g., or onsider a sum-of-products expression L = + + G + G The primary divisors of an expression form a set of expressions (L) = {L/ is a cube} quation is cube-free if no cubes divide it evenly + is cube-free + is not cube-free ivided evenly by 35 Robert ick dvanced igital Logic esign 36 Robert ick dvanced igital Logic esign
5 Multi-level minimization definitions Kernel The kernels of an expression are sets of expressions K(L) = {G G (L) and G is cube-free} In other words, the kernels are divisors of the function for cube quotients that can not be evenly divided (remainder-free) by other cubes The cube used to divide L to obtain the kernel K(L) is called the co-kernel L = + + G + G ube Primary divisor Kernel (cube free) ( + G + ) k ( + ) k 2 (G + ) k 3 ( + + ) no ( + + ) no ( + ) k 4 G ( + ) k 5 ( + + ) k 6 37 Robert ick dvanced igital Logic esign 38 Robert ick dvanced igital Logic esign ivisor selection ivisor selection Kernels are often good divisors, extract and substitute L = + + G + G ivide by k 6 = ( + + ) 7 literals L = k 4 + G + G + k 6 Remaining kernel: k 5 = ( + ) L = + + G + G + k 6 Remaining kernels: k = ( + G),k 4 = ( + ),k 5 = ( + ) Pick one L = k 4 + G + G + k 6 L = k 4 + G + G + k 6 L = k 4 + Gk 5 + k 6 nd result L = ( + ) + G( + ) + ( + + ) literals 39 Robert ick dvanced igital Logic esign 4 Robert ick dvanced igital Logic esign Node simplification Node simplification uring multi-level logic synthesis, representation broken into sub-functions ach sub-function (e.g., SOP form) needs to be minimized L = + + G + G Similar to using Karnaugh Maps, Quine Mcluskey, or spresso to simply expressions L = + + = + (,,) 4 Robert ick dvanced igital Logic esign 42 Robert ick dvanced igital Logic esign Node simplification Recall that two-level simplification can be improved using on t are information Need to find on t are automatically from oolean network Take advantage of satisfiability on t ares Input can never occur Take advantage of observability on t ares Output is ignored for certain inputs Ideal Real Inertial Transport time 43 Robert ick dvanced igital Logic esign 46 Robert ick dvanced igital Logic esign
6 Ideal No delay, outputs respond instantly to inputs Transport Output shifted by some fixed duration ll input changes reflected at output Inertial Transitions that are not stable for more than some threshold period of time are absorbed by the gate Provides a coarse approximation to real digital logic gate behavior Real Outputs quickly respond to input changes However, output changes have limited slew-rates 47 Robert ick dvanced igital Logic esign 48 Robert ick dvanced igital Logic esign R delay IO thresholds What happens when a transistor drives another transistor? Recall how MOS transistors work 49 Robert ick dvanced igital Logic esign 5 Robert ick dvanced igital Logic esign IO thresholds Molten transistor V igital is a simplifying concept in a (macroscopically) analog world To treat signals as digital, need to define a dividing line between false and true What actually happens to the next stage when the voltage is at that line? NMOS V GS > V T PMOS V GS < V T =? = =? = = = V SS 52 Robert ick dvanced igital Logic esign 53 Robert ick dvanced igital Logic esign IO thresholds IO thresholds efine valid ranges of logic high and logic low signals Undefined signals considered invalid etter However, still have a problem What happens if the output of a gate is near that threshold? Slight variation between gates might result in crossing this threshold for next gate How to compensate? Use separate input and output thresholds 54 Robert ick dvanced igital Logic esign 55 Robert ick dvanced igital Logic esign
7 Separate IO thresholds Schmitt triggers Now, we can safely treat the system as digital However, digital systems talk with analog systems It is necessary to deal with noisy signals Real slew isn t ideal transition 56 Robert ick dvanced igital Logic esign 57 Robert ick dvanced igital Logic esign Reason for gradual transition MOS NOT is R network V V logic stage is an R network Whenever a transition occurs, capacitance is driven through resistance onsider the implementation of a MOS inverter V SS V SS 58 Robert ick dvanced igital Logic esign 59 Robert ick dvanced igital Logic esign What is driven in NN2? ebouncing Mechanical switches bounce! What happens if multiple pulses? Mutliple state transitions Need to clean up signal 6 Robert ick dvanced igital Logic esign 6 Robert ick dvanced igital Logic esign ebouncing Improving device delay 5 V Schmidt trig. R ecrease driven resistance and load Use smaller transistors Use shorter wire Use wider wire (can increase load) -.e-3-5.e-4.e+ 5.e-4.e-3.5e-3 T (s) 62 Robert ick dvanced igital Logic esign 63 Robert ick dvanced igital Logic esign
8 Improving device delay riving large loads Increase drive by increasing width of driving transistors auses problems Larger transistors provide larger loads to their inputs In general, keep transistors small unless they absolutely need to drive large loads Sometimes large loads need to be driven Long wires Output pads What happens if we go from a minimum-size inverter to a huge inverter? Huge delay driving huge inverter s gate 64 Robert ick dvanced igital Logic esign 65 Robert ick dvanced igital Logic esign Tapered buffer chain Useful delay: ebouncing Instead, gradually increase buffers in chain Optimal number of stages: ln ( IG/SMLL) Stage width exponentially increases in α W = W MIN α W 2 = W MIN α W 3 = W MIN α 2 Mechanical switches bounce Noisy transition Use R delay network to decrease transition speed onvert multiple noisy to single smooth transition Use Schmitt trigger to clean signal 66 Robert ick dvanced igital Logic esign 67 Robert ick dvanced igital Logic esign elay estimation in multi-level circuits Topological sort an get delay for a gate by knowing its drive (resistance) and the load it drives (R) Gate libraries will have this information Still need to get network delay onduct topological sort of network to find earliest start times (ST) lways visit a node s parent before visiting it ST is maximum any parent s ST plus it s delay 5 ST = max(9, ) Robert ick dvanced igital Logic esign 69 Robert ick dvanced igital Logic esign Slack Useful delay: Rising edge pulse shaping an use reverse topological sort from end nodes (given some target delay) to get latest start time (LST) Subtract delays and take minimum over children instead of adding delays and taking maximum over parents Subtract ST from LST to get node slack Gates with lowest slack are on critical path Make this path faster......or save area (at the expense of speed) on non-critical paths Problem: Pulse width poorly controlled 7 Robert ick dvanced igital Logic esign 7 Robert ick dvanced igital Logic esign
9 Useful delay: Pulse rising/falling edge pulse shaping ynamic hazards losed switch xxxxx Initially undefined xxxx Resistor Open Switch + Open switch Potential for two or more spurious transitions before intended transition Results from uneven path delays in some multi-level circuits ynamic hazards Problem: Pulse width poorly controlled 72 Robert ick dvanced igital Logic esign 74 Robert ick dvanced igital Logic esign ynamic hazards liminating dynamic hazards G S low Very slow Some approaches allow preservation of multi-level structure Quite complicated to apply Simpler solution onvert to two-level implementation 75 Robert ick dvanced igital Logic esign 76 Robert ick dvanced igital Logic esign Static hazards Problems with glitches Still have static hazards Potential for transient change of output to incorrect value Static hazard Static hazard These transitions result in incorrect output values at some times lso result in uselessly charging and discharging wire and gate capacitances through wire, gate, and channel resistances Increase power consumption 77 Robert ick dvanced igital Logic esign 78 Robert ick dvanced igital Logic esign Glitches increase power consumption etecting hazards V V The observable effect of a hazard is a glitch circuit that might exhibit a glitch has a hazard V SS V SS Whether or not a hazard is observed as a glitch depends on relative gate delays Relative gate delays change depending on a number of factors onditions during fabrication, temperature, age, etc. est to use abstract reasoning to determine whether hazards might be observed in practice, under some conditions 79 Robert ick dvanced igital Logic esign 8 Robert ick dvanced igital Logic esign
10 liminating static hazards liminating static hazards G G = = input change within product term G = = ( is s till ) G = + G = ( is ) 8 Robert ick dvanced igital Logic esign 82 Robert ick dvanced igital Logic esign liminating static hazards Where do static hazards really come from? dd redundant primes covering all - transitions in SOP dd redundant primes covering all - transitions in POS learly primes can be used, consider contradiction stemming from assumption that non-prime is necessary to cover a transition Static-: Static-: + ssume SOP form has no product terms containing a variable in complemented and uncomplemented forms Reasonable assumption, if true, drop product term 83 Robert ick dvanced igital Logic esign 84 Robert ick dvanced igital Logic esign Where do static hazards really come from? Living with hazards ssume POS form has no sum terms containing a variable in complemented and uncomplemented forms Reasonable assumption, if true, drop sum term ssume only one input switches at a time onclusion: SOP has no -hazards and POS has no -hazards In other words, if you are doing two-level design, you need not analyze the other form for hazards Sometimes hazards can be tolerated ombinational logic whose outputs aren t observed at all times Synchronous systems Systems without tight power consumption limits 85 Robert ick dvanced igital Logic esign 86 Robert ick dvanced igital Logic esign Summary rief review of cascaded carry lookahead adder ommon LU operations Overview of memory types behavior 87 Robert ick dvanced igital Logic esign
12/31/2010. Overview. 10-Combinational Circuit Design Text: Unit 8. Limited Fan-in. Limited Fan-in. Limited Fan-in. Limited Fan-in
Overview 10-ombinational ircuit esign Text: Unit 8 Gates with elays and Timing Other Hazards GR/ISS 201 igital Operations and omputations Winter 2011 r. Louie 2 Practical logic gates are limited by the
More informationChapter # 3: Multi-Level Combinational Logic
hapter # 3: Multi-Level ombinational Logic ontemporary Logic esign Randy H. Katz University of alifornia, erkeley June 993 No. 3- hapter Overview Multi-Level Logic onversion to NN-NN and - Networks emorgan's
More informationDigital Integrated Circuits A Design Perspective
igital Integrated Circuits esign Perspective esigning Combinational Logic Circuits 1 Combinational vs. Sequential Logic In Combinational Logic Circuit Out In Combinational Logic Circuit Out State Combinational
More informationProblem Set 4 Solutions
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 ((()
More informationProperties of CMOS Gates Snapshot
MOS logic 1 Properties of MOS Gates Snapshot High noise margins: V OH and V OL are at V DD and GND, respectively. No static power consumption: There never exists a direct path between V DD and V SS (GND)
More informationCombinational Logic Design
PEN 35 - igital System esign ombinational Logic esign hapter 3 Logic and omputer esign Fundamentals, 4 rd Ed., Mano 2008 Pearson Prentice Hall esign oncepts and utomation top-down design proceeds from
More informationCombinational Logic (mostly review!)
ombinational Logic (mostly review!)! Logic functions, truth tables, and switches " NOT, N, OR, NN, NOR, OR,... " Minimal set! xioms and theorems of oolean algebra " Proofs by re-writing " Proofs by perfect
More informationDigital Integrated Circuits A Design Perspective
Digital Integrated Circuits Design Perspective Jan M. Rabaey nantha Chandrakasan orivoje Nikolić Designing Combinational Logic Circuits November 2002. 1 Combinational vs. Sequential Logic In Combinational
More information9/18/2008 GMU, ECE 680 Physical VLSI Design
ECE680: Physical VLSI Design Chapter III CMOS Device, Inverter, Combinational circuit Logic and Layout Part 3 Combinational Logic Gates (textbook chapter 6) 9/18/2008 GMU, ECE 680 Physical VLSI Design
More information:3 2 D e c o de r S ubs ys te m "0 " One "1 " Ze ro "0 " "0 " One I 1 "0 " One "1 " Ze ro "1 " Ze ro "0 " "0 "
dvanced igital Logic esign EES 303 http://ziyang.eecs.northwestern.edu/eecs303/ 5:32 decoder/demultiplexer Teacher: Robert ick Office: L477 Tech Email: dickrp@northwestern.edu Phone: 847 467 2298 \EN 5:32
More informationCMOS Digital Integrated Circuits Lec 10 Combinational CMOS Logic Circuits
Lec 10 Combinational CMOS Logic Circuits 1 Combinational vs. Sequential Logic In Combinational Logic circuit Out In Combinational Logic circuit Out State Combinational The output is determined only by
More informationCSE140: Components and Design Techniques for Digital Systems. Logic minimization algorithm summary. Instructor: Mohsen Imani UC San Diego
CSE4: Components and Design Techniques for Digital Systems Logic minimization algorithm summary Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing & Dr.Pietro Mercati Definition
More informationCPE/EE 427, CPE 527 VLSI Design I L07: CMOS Logic Gates, Pass Transistor Logic. Review: CMOS Circuit Styles
PE/EE 427, PE 527 VLI esign I L07: MO Logic Gates, Pass Transistor Logic epartment of Electrical and omputer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka
More informationSimlification of Switching Functions
Simlification of Switching unctions ( ) = ( 789 5) Quine-Mc luskey Original nonminimized oolean function m i m i m n m i [] m m m m m 4 m 5 m 6 m 7 m 8 m 9 m m m m m 4 m 5 m m m 7 m 8 m 9 m m 5 The number
More informationCombinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions
ombinational logic Possible logic functions of two variables asic logic oolean algebra, proofs by re-writing, proofs by perfect induction Logic functions, truth tables, and switches NOT, N, OR, NN,, OR,...,
More informationPossible logic functions of two variables
ombinational logic asic logic oolean algebra, proofs by re-writing, proofs by perfect induction logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,..., minimal set Logic realization
More informationCMPEN 411 VLSI Digital Circuits Spring Lecture 14: Designing for Low Power
CMPEN 411 VLSI Digital Circuits Spring 2012 Lecture 14: Designing for Low Power [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan, B. Nikolic] Sp12 CMPEN
More informationEE141Microelettronica. CMOS Logic
Microelettronica CMOS Logic CMOS logic Power consumption in CMOS logic gates Where Does Power Go in CMOS? Dynamic Power Consumption Charging and Discharging Capacitors Short Circuit Currents Short Circuit
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd hapter 5 Modified by Yuttapong Jiraraksopakun Floyd, Digital Fundamentals, 10 th 2008 Pearson Education ENE, KMUTT ed 2009 2009 Pearson Education, Upper Saddle
More informationCPE/EE 427, CPE 527 VLSI Design I L06: CMOS Inverter, CMOS Logic Gates. Course Administration. CMOS Inverter: A First Look
CPE/EE 47, CPE 57 VLSI esign I L6: CMOS Inverter, CMOS Logic Gates epartment of Electrical and Computer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka )
More informationWorking with combinational logic
Working with combinational logic Simplification two-level simplification exploiting don t cares algorithm for simplification Logic realization two-level logic and canonical forms realized with NNs and
More informationChapter 2. Introduction. Chapter 2 :: Topics. Circuits. Nodes. Circuit elements. Introduction
hapter 2 Introduction igital esign and omputer rchitecture, 2 nd Edition avid Money Harris and Sarah L. Harris logic circuit is composed of: Inputs Outputs Functional specification Timing specification
More informationDesigning Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Homework 1. This homework is due September 5, 2017, at 11:59AM.
EECS 16 Designing Information Devices and Systems II Fall 017 Miki Lustig and Michel Maharbiz Homework 1 This homework is due September 5, 017, at 11:59M. 1. Fundamental Theorem of Solutions to Differential
More informationTHE INVERTER. Inverter
THE INVERTER DIGITAL GATES Fundamental Parameters Functionality Reliability, Robustness Area Performance» Speed (delay)» Power Consumption» Energy Noise in Digital Integrated Circuits v(t) V DD i(t) (a)
More informationEEC 116 Lecture #5: CMOS Logic. Rajeevan Amirtharajah Bevan Baas University of California, Davis Jeff Parkhurst Intel Corporation
EEC 116 Lecture #5: CMOS Logic Rajeevan mirtharajah Bevan Baas University of California, Davis Jeff Parkhurst Intel Corporation nnouncements Quiz 1 today! Lab 2 reports due this week Lab 3 this week HW
More informationECE 407 Computer Aided Design for Electronic Systems. Simulation. Instructor: Maria K. Michael. Overview
407 Computer Aided Design for Electronic Systems Simulation Instructor: Maria K. Michael Overview What is simulation? Design verification Modeling Levels Modeling circuits for simulation True-value simulation
More informationDelay and Power Estimation
EEN454 Digital Integrated ircuit Design Delay and Power Estimation EEN 454 Delay Estimation We would like to be able to easily estimate delay Not as accurate as simulation But make it easier to ask What
More informationDigital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101>
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer Architecture David Money Harris and
More informationCMOS Inverter: CPE/EE 427, CPE 527 VLSI Design I L06: CMOS Inverter, CMOS Logic Gates. Course Administration. CMOS Properties.
CMOS Inverter: Steady State Response CPE/EE 47, CPE 57 VLSI esign I L6: CMOS Inverter, CMOS Logic Gates R p V OL = V OH = V M = f(r n, R p ) epartment of Electrical and Computer Engineering University
More informationEE115C Digital Electronic Circuits Homework #4
EE115 Digital Electronic ircuits Homework #4 Problem 1 Power Dissipation Solution Vdd =1.0V onsider the source follower circuit used to drive a load L =20fF shown above. M1 and M2 are both NMOS transistors
More informationChapter 9. Estimating circuit speed. 9.1 Counting gate delays
Chapter 9 Estimating circuit speed 9.1 Counting gate delays The simplest method for estimating the speed of a VLSI circuit is to count the number of VLSI logic gates that the input signals must propagate
More informationChapter 5 CMOS Logic Gate Design
Chapter 5 CMOS Logic Gate Design Section 5. -To achieve correct operation of integrated logic gates, we need to satisfy 1. Functional specification. Temporal (timing) constraint. (1) In CMOS, incorrect
More information12/31/2010. Overview. 05-Boolean Algebra Part 3 Text: Unit 3, 7. DeMorgan s Law. Example. Example. DeMorgan s Law
Overview 05-oolean lgebra Part 3 Text: Unit 3, 7 EEGR/ISS 201 Digital Operations and omputations Winter 2011 DeMorgan s Laws lgebraic Simplifications Exclusive-OR and Equivalence Functionally omplete NND-NOR
More informationEECS 312: Digital Integrated Circuits Midterm Exam Solutions 12 March 2009
Signature: EECS 312: igital Integrated Circuits Midterm Exam Solutions 12 March 2009 Robert ick Show your work. erivations are required for credit; end results are insufficient. Closed book. No electronic
More informationFig. 1 CMOS Transistor Circuits (a) Inverter Out = NOT In, (b) NOR-gate C = NOT (A or B)
1 Introduction to Transistor-Level Logic Circuits 1 By Prawat Nagvajara At the transistor level of logic circuits, transistors operate as switches with the logic variables controlling the open or closed
More informationCOSC3330 Computer Architecture Lecture 2. Combinational Logic
COSC333 Computer rchitecture Lecture 2. Combinational Logic Instructor: Weidong Shi (Larry), PhD Computer Science Department University of Houston Today Combinational Logic oolean lgebra Mux, DeMux, Decoder
More informationObjective and Outline. Acknowledgement. Objective: Power Components. Outline: 1) Acknowledgements. Section 4: Power Components
Objective: Power Components Outline: 1) Acknowledgements 2) Objective and Outline 1 Acknowledgement This lecture note has been obtained from similar courses all over the world. I wish to thank all the
More informationHomework #2 10/6/2016. C int = C g, where 1 t p = t p0 (1 + C ext / C g ) = t p0 (1 + f/ ) f = C ext /C g is the effective fanout
0/6/06 Homework # Lecture 8, 9: Sizing and Layout of omplex MOS Gates Reading: hapter 4, sections 4.3-4.5 October 3 & 5, 06 hapter, section.5.5 Prof. R. Iris ahar Weste & Harris vailable on course webpage
More informationWorking with Combinational Logic. Design example: 2x2-bit multiplier
Working with ombinational Logic Simplification two-level simplification exploiting don t cares algorithm for simplification Logic realization two-level logic and canonical forms realized with NNs and NORs
More informationCOMBINATIONAL LOGIC. Combinational Logic
COMINTIONL LOGIC Overview Static CMOS Conventional Static CMOS Logic Ratioed Logic Pass Transistor/Transmission Gate Logic Dynamic CMOS Logic Domino np-cmos Combinational vs. Sequential Logic In Logic
More informationComputer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 Topic Notes: Digital Logic Our goal for the next few weeks is to paint a a reasonably complete picture of how we can go from transistor
More informationLecture 16: Circuit Pitfalls
Introduction to CMOS VLSI Design Lecture 16: Circuit Pitfalls David Harris Harvey Mudd College Spring 2004 Outline Pitfalls Detective puzzle Given circuit and symptom, diagnose cause and recommend solution
More informationCOMP 103. Lecture 16. Dynamic Logic
COMP 03 Lecture 6 Dynamic Logic Reading: 6.3, 6.4 [ll lecture notes are adapted from Mary Jane Irwin, Penn State, which were adapted from Rabaey s Digital Integrated Circuits, 2002, J. Rabaey et al.] COMP03
More informationStatic CMOS Circuits
Static MOS ircuits l onventional (ratio-less) static MOS» overed so far l Ratio-ed logic (depletion load, pseudo nmos) l ass transistor logic ombinational vs. Sequential Logic In Logic ircuit In Logic
More informationWhy digital? Overview. Number Systems. Binary to Decimal conversion
Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not
More informationCMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 07: Pass Transistor Logic
CMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 07: Pass Transistor Logic [dapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey,. Chandrakasan,. Nikolic] Sp11 CMPEN 411
More informationIntroduction to Computer Engineering ECE 203
Introduction to Computer Engineering ECE 203 Northwestern University Department of Electrical Engineering and Computer Science Teacher: Robert Dick Office: L477 Tech Email: dickrp@ece.northwestern.edu
More informationChap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization
More informationMulti-Level Logic Optimization. Technology Independent. Thanks to R. Rudell, S. Malik, R. Rutenbar. University of California, Berkeley, CA
Technology Independent Multi-Level Logic Optimization Prof. Kurt Keutzer Prof. Sanjit Seshia EECS University of California, Berkeley, CA Thanks to R. Rudell, S. Malik, R. Rutenbar 1 Logic Optimization
More informationfor Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid
SE140: omponents and Design Techniques for Digital Systems Simplification of logic functions Tajana Simunic Rosing 1 What we covered thus far: Number representations Where we are now inary, Octal, Hex,
More informationDigital Logic & Computer Design CS Professor Dan Moldovan Spring 2010
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer rchitecture David Money Harris and
More informationEECS 312: Digital Integrated Circuits Midterm Exam 2 December 2010
Signature: EECS 312: Digital Integrated Circuits Midterm Exam 2 December 2010 obert Dick Show your work. Derivations are required for credit; end results are insufficient. Closed book. No electronic mental
More informationEE 330 Lecture 6. Improved Switch-Level Model Propagation Delay Stick Diagrams Technology Files
EE 330 Lecture 6 Improved witch-level Model Propagation elay tick iagrams Technology Files Review from Last Time MO Transistor Qualitative iscussion of n-channel Operation Bulk ource Gate rain rain G Gate
More informationTopics to be Covered. capacitance inductance transmission lines
Topics to be Covered Circuit Elements Switching Characteristics Power Dissipation Conductor Sizes Charge Sharing Design Margins Yield resistance capacitance inductance transmission lines Resistance of
More informationDC and Transient. Courtesy of Dr. Daehyun Dr. Dr. Shmuel and Dr.
DC and Transient Courtesy of Dr. Daehyun Lim@WSU, Dr. Harris@HMC, Dr. Shmuel Wimer@BIU and Dr. Choi@PSU http://csce.uark.edu +1 (479) 575-604 yrpeng@uark.edu Pass Transistors We have assumed source is
More informationE40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1
E40M Binary Numbers M. Horowitz, J. Plummer, R. Howe 1 Reading Chapter 5 in the reader A&L 5.6 M. Horowitz, J. Plummer, R. Howe 2 Useless Box Lab Project #2 Adding a computer to the Useless Box alows us
More informationLecture Outline. ESE 570: Digital Integrated Circuits and VLSI Fundamentals. Restore Output. Pass Transistor Logic. How compare.
ESE 570: igital Integrated ircuits and VLSI undamentals Lec 16: March 19, 2019 Euler Paths and Energy asics & Optimization Lecture Outline! Pass Transistor Logic! Logic omparison! Transmission Gates! Euler
More informationGates. Quiz 1 will cover up to and including this lecture. The book says something about NAND... maybe an in-law. Is he talking about BILL??? 6.
Gates Is he talking about ILL??? The book says something about NND... maybe an in-law. WRD & HLSTED 6.4 NERD KIT Quiz will cover up to and including this lecture 6.4 - Fall 22 9/7/2 L4 - Gates Quick Review
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing
More informationUsing MOS Models. C.K. Ken Yang UCLA Courtesy of MAH EE 215B
Using MOS Models C.K. Ken Yang UCLA yangck@ucla.edu Courtesy of MAH 1 Overview Reading Rabaey 5.4 W&H 4.2 Background In the past two lectures we have reviewed the iv and CV curves for MOS devices, both
More informationLecture 5: DC & Transient Response
Lecture 5: DC & Transient Response Outline q Pass Transistors q DC Response q Logic Levels and Noise Margins q Transient Response q RC Delay Models q Delay Estimation 2 Activity 1) If the width of a transistor
More informationDigital Microelectronic Circuits ( )
Digital Microelectronic ircuits (361-1-3021 ) Presented by: Dr. Alex Fish Lecture 5: Parasitic apacitance and Driving a Load 1 Motivation Thus far, we have learned how to model our essential building block,
More informationDigital Integrated Circuits Designing Combinational Logic Circuits. Fuyuzhuo
Digital Integrated Circuits Designing Combinational Logic Circuits Fuyuzhuo Introduction Digital IC Dynamic Logic Introduction Digital IC EE141 2 Dynamic logic outline Dynamic logic principle Dynamic logic
More informationHomework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker
Homework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker Note: + implies OR,. implies AND, ~ implies NOT Question 1: a) (4%) Use transmission gates to design a 3-input OR gate Note: There are
More informationCPE/EE 427, CPE 527 VLSI Design I Pass Transistor Logic. Review: CMOS Circuit Styles
PE/EE 427, PE 527 VLI Design I Pass Transistor Logic Department of Electrical and omputer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka ) Review: MO ircuit
More informationDigital Integrated Circuits A Design Perspective
Digital Integrated Circuits Design Perspective Designing Combinational Logic Circuits Fuyuzhuo School of Microelectronics,SJTU Introduction Digital IC Dynamic Logic Introduction Digital IC 2 EE141 Dynamic
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. orriello, Contemporary Logic Design (second edition), Pearson Education,
More informationTopic 4. The CMOS Inverter
Topic 4 The CMOS Inverter Peter Cheung Department of Electrical & Electronic Engineering Imperial College London URL: www.ee.ic.ac.uk/pcheung/ E-mail: p.cheung@ic.ac.uk Topic 4-1 Noise in Digital Integrated
More informationFloating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
More informationCombinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions.
Combinational logic Possible logic functions of two variables Logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,... Minimal set xioms and theorems of oolean algebra Proofs by re-writing
More informationEECS 270 Midterm 2 Exam Answer Key Winter 2017
EES 270 Midterm 2 Exam nswer Key Winter 2017 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. NOTES: 1. This part of the exam
More informationE40M Capacitors. M. Horowitz, J. Plummer, R. Howe
E40M Capacitors 1 Reading Reader: Chapter 6 Capacitance A & L: 9.1.1, 9.2.1 2 Why Are Capacitors Useful/Important? How do we design circuits that respond to certain frequencies? What determines how fast
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences Analysis and Design of Digital Integrated Circuits (6.374) - Fall 2003 Quiz #2 Prof. Anantha Chandrakasan
More informationC.K. Ken Yang UCLA Courtesy of MAH EE 215B
Decoders: Logical Effort Applied C.K. Ken Yang UCLA yang@ee.ucla.edu Courtesy of MAH 1 Overview Reading Rabaey 6.2.2 (Ratio-ed logic) W&H 6.2.2 Overview We have now gone through the basics of decoders,
More informationLecture 5: DC & Transient Response
Lecture 5: DC & Transient Response Outline Pass Transistors DC Response Logic Levels and Noise Margins Transient Response RC Delay Models Delay Estimation 2 Pass Transistors We have assumed source is grounded
More informationESE570 Spring University of Pennsylvania Department of Electrical and System Engineering Digital Integrated Cicruits AND VLSI Fundamentals
University of Pennsylvania Department of Electrical and System Engineering Digital Integrated Cicruits AND VLSI Fundamentals ESE570, Spring 017 Final Wednesday, May 3 4 Problems with point weightings shown.
More informationEE 466/586 VLSI Design. Partha Pande School of EECS Washington State University
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University pande@eecs.wsu.edu Lecture 9 Propagation delay Power and delay Tradeoffs Follow board notes Propagation Delay Switching Time
More informationLogic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 2 Circuit Optimization
Logic and omputer Design Fundamentals hapter 2 ombinational Logic ircuits Part 2 ircuit Optimization harles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode)
More informationECE/Comp Sci 352 Digital System Fundamentals Quiz # 1 Solutions
Last (Family) Name: KIME First (Given) Name: Student I: epartment of Electrical and omputer Engineering University of Wisconsin - Madison EE/omp Sci 352 igital System Fundamentals Quiz # Solutions October
More informationStatic CMOS Circuits. Example 1
Static CMOS Circuits Conventional (ratio-less) static CMOS Covered so far Ratio-ed logic (depletion load, pseudo nmos) Pass transistor logic ECE 261 Krish Chakrabarty 1 Example 1 module mux(input s, d0,
More informationELEC Digital Logic Circuits Fall 2015 Logic Minimization (Chapter 3)
ELE 2200-002 igital Logic ircuits Fall 205 Logic Minimization (hapter 3) Vishwani. grawal James J. anaher Professor epartment of Electrical and omputer Engineering uburn University, uburn, L 36849 http://www.eng.auburn.edu/~vagrawal
More informationDigital Integrated Circuits A Design Perspective
Designing ombinational Logic ircuits dapted from hapter 6 of Digital Integrated ircuits Design Perspective Jan M. Rabaey et al. opyright 2003 Prentice Hall/Pearson 1 ombinational vs. Sequential Logic In
More informationDigital Electronics Part II - Circuits
Digital Electronics Part - Circuits Dr.. J. Wassell Gates from Transistors ntroduction Logic circuits are non-linear, consequently we will introduce a graphical technique for analysing such circuits The
More informationMODULE III PHYSICAL DESIGN ISSUES
VLSI Digital Design MODULE III PHYSICAL DESIGN ISSUES 3.2 Power-supply and clock distribution EE - VDD -P2006 3:1 3.1.1 Power dissipation in CMOS gates Power dissipation importance Package Cost. Power
More informationMOSFET and CMOS Gate. Copy Right by Wentai Liu
MOSFET and CMOS Gate CMOS Inverter DC Analysis - Voltage Transfer Curve (VTC) Find (1) (2) (3) (4) (5) (6) V OH min, V V OL min, V V IH min, V V IL min, V OHmax OLmax IHmax ILmax NM L = V ILmax V OL max
More informationPLA Minimization for Low Power VLSI Designs
PLA Minimization for Low Power VLSI Designs Sasan Iman, Massoud Pedram Department of Electrical Engineering - Systems University of Southern California Chi-ying Tsui Department of Electrical and Electronics
More informationB.Supmonchai August 1st, q In-depth discussion of CMOS logic families. q Optimizing gate metrics. q High Performance circuit-design techniques
ugust st, 4 Goals of This hapter hapter 6 Static MOS ircuits oonchuay Supmonchai Integrated esign pplication Research (IR) Laboratory ugust, 4; Revised - June 8, 5 In-depth discussion of MOS logic families
More informationS.E. Sem. III [ETRX] Digital Circuit Design. t phl. Fig.: Input and output voltage waveforms to define propagation delay times.
S.E. Sem. III [ETRX] Digital ircuit Design Time : 3 Hrs.] Prelim Paper Solution [Marks : 80. Solve following : [20].(a) Explain characteristics of logic families. [5] haracteristics of logic families are
More informationNAND3_X1. Page 104 of 969
NAND3_X1 Databook Build Date: Thursday Feb 17 15:07 2011 Copyright 2004-2010 Nangate Inc. Conditions for characterization library NangateOpenCellLibrary, corner NangateOpenCellLibrary_typical_typical:
More informationLecture 6: DC & Transient Response
Lecture 6: DC & Transient Response Slides courtesy of Deming Chen Slides based on the initial set from David Harris CMOS VLSI Design Outline Pass Transistors DC Response Logic Levels and Noise Margins
More informationDC and Transient Responses (i.e. delay) (some comments on power too!)
DC and Transient Responses (i.e. delay) (some comments on power too!) Michael Niemier (Some slides based on lecture notes by David Harris) 1 Lecture 02 - CMOS Transistor Theory & the Effects of Scaling
More informationEECS 312: Digital Integrated Circuits Midterm Exam 2 December 2010
Signature: EECS 312: Digital Integrated Circuits Midterm Exam 2 December 2010 Robert Dick Show your work. Derivations are required for credit; end results are insufficient. Closed book. No electronic mental
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and Boolean Algebra) Acknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. Borriello, Contemporary Logic Design (second edition), Pearson
More informationLecture 12 Digital Circuits (II) MOS INVERTER CIRCUITS
Lecture 12 Digital Circuits (II) MOS INVERTER CIRCUITS Outline NMOS inverter with resistor pull-up The inverter NMOS inverter with current-source pull-up Complementary MOS (CMOS) inverter Static analysis
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences
MSSCHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences nalysis and Design of Digital Integrated Circuits (6.374) - Fall 2003 Quiz #1 Prof. nantha Chandrakasan Student
More information14:332:231 DIGITAL LOGIC DESIGN. Organizational Matters (1)
4:332:23 DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering Fall 23 Organizational Matters () Instructor: Ivan MARSIC Office: CoRE Building, room 7 Email: marsic@ece.rutgers.edu
More informationLearning Objectives. Boolean Algebra. In this chapter you will learn about:
Ref. Page Slide /78 Learning Objectives In this chapter you will learn about: oolean algebra Fundamental concepts and basic laws of oolean algebra oolean function and minimization Logic gates Logic circuits
More informationLecture 4: Implementing Logic in CMOS
Lecture 4: Implementing Logic in CMOS Mark Mcermott Electrical and Computer Engineering The University of Texas at ustin Review of emorgan s Theorem Recall that: () = + and = ( + ) (+) = and + = ( ) ()
More informationThe goal differs from prime factorization. Prime factorization would initialize all divisors to be prime numbers instead of integers*
Quantum Algorithm Processor For Finding Exact Divisors Professor J R Burger Summary Wiring diagrams are given for a quantum algorithm processor in CMOS to compute, in parallel, all divisors of an n-bit
More informationCARNEGIE MELLON UNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING DIGITAL INTEGRATED CIRCUITS FALL 2002
CARNEGIE MELLON UNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING 18-322 DIGITAL INTEGRATED CIRCUITS FALL 2002 Final Examination, Monday Dec. 16, 2002 NAME: SECTION: Time: 180 minutes Closed
More information