Timing Behavior of Gates

Slides:



Advertisements
Similar presentations
CS370 – Spring 2003 Hazards/Glitches. Time Response in Combinational Networks Gate Delays and Timing Waveforms Hazards/Glitches and How To Avoid Them.
Advertisements

ECE C03 Lecture 71 Lecture 7 Delays and Timing in Multilevel Logic Synthesis Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Glitches & Hazards.
ECE 3110: Introduction to Digital Systems
ECE C03 Lecture 81 Lecture 8 Memory Elements and Clocking Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Lecture 11: Sequential Circuit Design. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 11: Sequential Circuits2 Outline  Sequencing  Sequencing Element Design.
Chapter 6 –Selected Design Topics Part 2 – Propagation Delay and Timing Logic and Computer Design Fundamentals.
1 Combinational Logic Network design Chapter 4 (continued ….)
1 Lecture 28 Timing Analysis. 2 Overview °Circuits do not respond instantaneously to input changes °Predictable delay in transferring inputs to outputs.
Introduction to CMOS VLSI Design Lecture 19: Design for Skew David Harris Harvey Mudd College Spring 2004.
A Look at Chapter 4: Circuit Characterization and Performance Estimation Knowing the source of delays in CMOS gates and being able to estimate them efficiently.
Introduction to CMOS VLSI Design Clock Skew-tolerant circuits.
Clock Design Adopted from David Harris of Harvey Mudd College.
ISLAMIC UNIVERSITY OF GAZA Faculty of Engineering Computer Engineering Department EELE3321: Digital Electronics Course Asst. Prof. Mohammed Alhanjouri.
Contemporary Logic Design Multi-Level Logic © R.H. Katz Transparency No Chapter # 3: Multi-Level Combinational Logic 3.3 and Time Response.
EECC341 - Shaaban #1 Lec # 8 Winter Combinational Logic Circuit Transient Vs. Steady-state Output Gate propagation delay: The time between.
Give qualifications of instructors: DAP
Asynchronous Machines
Lecture #24 Gates to circuits
Lecture #8 Circuits with Capacitors
ECE C03 Lecture 61 Lecture 6 Delays and Timing in Multilevel Logic Synthesis Prith Banerjee ECE C03 Advanced Digital Design Spring 1998.
Logic Simulation 2 Outline –Timing Models –Simulation Algorithms Goal –Understand timing models –Understand simulation algorithms Reading –Gate-Level Simulation.
Computer ArchitectureFall 2008 © August 20 th, Introduction to Computer Architecture Lecture 2 – Digital Logic Design.

Chapter #6: Sequential Logic Design 6.2 Timing Methodologies
CS 151 Digital Systems Design Lecture 32 Hazards
Modern VLSI Design 2e: Chapter 4 Copyright  1998 Prentice Hall PTR Topics n Crosstalk. n Power optimization.
Contemporary Logic Design Sequential Logic © R.H. Katz Transparency No Chapter #6: Sequential Logic Design Sequential Switching Networks.
The CMOS Inverter Slides adapted from:
ECE 331 – Digital System Design Power Dissipation and Additional Design Constraints (Lecture #14) The slides included herein were taken from the materials.
EE466: VLSI Design Power Dissipation. Outline Motivation to estimate power dissipation Sources of power dissipation Dynamic power dissipation Static power.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Interconnect design. n Crosstalk. n Power optimization.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 12 – Design Procedure.
EE415 VLSI Design DYNAMIC LOGIC [Adapted from Rabaey’s Digital Integrated Circuits, ©2002, J. Rabaey et al.]
1 Digital Design: Time Behavior of Combinational Networks Credits : Slides adapted from: J.F. Wakerly, Digital Design, 4/e, Prentice Hall, 2006 C.H. Roth,
Ratioed Circuits Ratioed circuits use weak pull-up and stronger pull-down networks. The input capacitance is reduced and hence logical effort. Correct.
© BYU 18 ASYNCH Page 1 ECEn 224 Handling Asynchronous Inputs.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Interconnect design. n Crosstalk. n Power optimization.
Topic: Sequential Circuit Course: Logic Design Slide no. 1 Chapter #6: Sequential Logic Design.
4. Combinational Logic Networks Layout Design Methods 4. 2
Topics Combinational network delay.
1 K-Maps, Multi-level Circuits, Time Response Today: Reminder: Test #1, Thu 7-9pm K-map example, espressoFirst Hour: K-map example, espresso –Section 2.3.
Combinational Hazards Brandon L Fernandes University of Southern California.
Timing Analysis Section Delay Time Def: Time required for output signal Y to change due to change in input signal X Up to now, we have assumed.
Chapter 2 Digital Design and Computer Architecture, 2 nd Edition Chapter 2 David Money Harris and Sarah L. Harris.
1/8/ L16 Timing & Concurrency III Copyright Joanne DeGroat, ECE, OSU1 Timing & Concurrency III Delay Model foundations for simulation and.
Lecture 11 Timing diagrams Hazards.
Lecture 3. Combinational Logic 2 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.
EE141 © Digital Integrated Circuits 2nd Combinational Circuits 1 A few notes for your design  Finger and multiplier in schematic design  Parametric analysis.
EE141 Combinational Circuits 1 Chapter 6 (I) Designing Combinational Logic Circuits Dynamic CMOS LogicDynamic CMOS Logic V1.0 5/4/2003.
ECE 171 Digital Circuits Chapter 9 Hazards Herbert G. Mayer, PSU Status 2/21/2016 Copied with Permission from prof. Mark PSU ECE.
Physical Properties of Logic Devices Technician Series Created Mar
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University
Circuit Analyze  Combinational or Sequential logic schematics show the circuit’s hardware implementation and give us some knowledge about the functions.
Lecture 3. Combinational Logic #2 Prof. Taeweon Suh Computer Science & Engineering Korea University COSE221, COMP211 Logic Design.
©2010 Cengage Learning SLIDES FOR CHAPTER 8 COMBINATIONAL CIRCUIT DESIGN AND SIMULATION USING GATES Click the mouse to move to the next page. Use the ESC.
1 Digital Design Debdeep Mukhopadhyay Associate Professor Dept of Computer Science and Engineering NYU Shanghai and IIT Kharagpur.
High Speed Properties of Digital Gates, Copyright F. Canavero, R. Fantino Licensed to HDT - High Design Technology
Chapter 5 Combinational Logic 组合逻辑
Lecture 11 Logistics Last lecture Today HW4 due on Wednesday PLDs
Lecture 8 Combinational Network Design and Issues
Basic Delay in Gates Definitions
COMP211 Computer Logic Design Lecture 3. Combinational Logic 2
Overview Part 1 – The Design Space
ECE 434 Advanced Digital System L03
CPE/EE 422/522 Advanced Logic Design L02
Overview Last Lecture Conversion of two-level logic to NAND or NOR forms Multilevel logic AOI and OAI gates Today Timing and hazards Multiplexers and demultiplexers.
Lecture 13 Logistics Last lecture Today HW4 up, due on Wednesday PLDs
Chapter 3 Overview • Multi-Level Logic
Hazard-free Karnaugh Map Minimisation
Presentation transcript:

Timing Behavior of Gates ECEn/CS 224

Gates Have Non-Linear Input/Output Behavior Vcc Vout 0V Vcc Vin Plotting Vout vs. Vin shows non-linear voltage behavior ECEn/CS 224

Gates Also Don’t React Immediately Vin Vout tprop-rise Vin tprop-fall Vout tfall trise time tprop-fall and tprop-rise are measured from 50% of input swing to 50% of output swing trise is measured from 10% of output swing to 90% of output swing tfall is measured from 90% of output swing to 10% of output swing ECEn/CS 224

Kinds of Gate Delays Propagation Delays Match intuition about how fast the gate is… Rising and falling delays may be different Take into acount which nodes rising, which nodes falling to compute delay through network Rising and falling delays may be the same Ignore rising/falling behavior Will use most of this semester Rise and Fall Times Only indirectly related to how fast the gate is… Will not use in this course ECEn/CS 224

Gate Delays Delay values are usually provided for the gates you use Use those delay values when analyzing a circuit’s timing Here are the timing values we will use this chapter Wider gates are slower AND = NAND+NOT, etc… ECEn/CS 224

Critical Path Analysis Given a logic circuit, how fast will it run? How fast will its output react to changes on its inputs? Find the slowest path from any input to the output That is the critical path Add up propagation delays along that path F A A B B F G C E C D D Delay = tOR2 + tAND2 = 7ns Delay = 2 x tNAND2 + tOR3 = 10ns ECEn/CS 224

Kinds of Timing Analysis The more detail you provide  the more accurate the result Separate tprop-rise and tprop-fall  more accurate than a single tprop Take into account other effects  more accurate Temperature Power supply voltage Manufacturing variation Rise/fall times ECEn/CS 224

Environmental Delay Effects Temperature Variation Chips run faster when cool, slower when hot Voltage Variation Value of Vcc can affect delay Manufacturing Variation Two gates on the same integrated circuit may run at slightly different speeds Summary: gate delays are always given as a range of values that operational delay is guaranteed to be within. Example: 2ns +/- 0.2ns ECEn/CS 224

Loading Effects A gate that drives more circuitry is slower than a gate that drives less circuitry D C A E B Less heavily loaded  faster More heavily loaded  slower F ECEn/CS 224

Typical Loading-Dependent Delay Typical delay = tprop + k x Cload Loading-independent delay Load Loading-dependent factor For MOS technology, load is mostly capacitance For bipolar technology, load is both capacitance and current ECEn/CS 224

Analyzing A Logic Network B=1 F tNAND2 A tNAND2 F G ECEn/CS 224

More Analysis A D E F G 5ns 32ns 20ns 30ns 8ns 35ns 23ns 33ns 27ns B=1 C=1 D G F E 5ns 32ns A 20ns 30ns D 8ns 35ns E 23ns 33ns F 27ns 37ns 12ns G 39ns ECEn/CS 224

Completing a Timing Diagram – A Method Do most upstream signals first E and F in previous picture For every instant in timing diagram Compute each gate output as function of input(s) Place new gate output after appropriate delay on timing diagram. Move to downstream signals ECEn/CS 224

Glitch Behavior Does the glitch propagate to the AND output? ? A F B A ECEn/CS 224

Behavior #1 Called transport delay F Called transport delay All glitches, not matter how narrow are propagated to output A B F ECEn/CS 224

Behavior #2 Called intertial delay F Called intertial delay Glitches narrower than some threshold are filtered out A B F ECEn/CS 224

Which Behavior Is Correct? Wires usually exhibit transport delay Gates usually exhibit some form of inertial delay Regardless, both wires and gates will filter out (or change the waveform shape of) extremely narrow pulses We will use transport for both gates and wires since we don’t know the pulse width thresholds ECEn/CS 224

Completing a Timing Diagram – A Shortcut Method Focus on input changes (edges) Everything constant in between ECEn/CS 224

Pulse width = 3 x tNOT + 1AND2 A Pulse Generator A F A F Pulse width = 3 x tNOT + 1AND2 F = A•A’ = 0 so why the pulse? Due to gate delays ECEn/CS 224

More Dynamic Gate Behavior F What will this circuit do? It will oscillate (0 – 1 – 0 – 1 - …) F Pulse width = tNOT Period of oscillation is 2 x tNOT ECEn/CS 224

This is the conventional KMap solution Logic Hazards F A’ B A C F = A’B + AC This is the conventional KMap solution ECEn/CS 224

Gates Have Real Timing… F g1 F A’ B=1 A C=1 Called a hazard or false output – static equations indicate F=1 but dynamic behavior gives a “glitch” g2 ECEn/CS 224

Hazards Each prime implicant from KMap is implemented using a single AND gate When moving between implicants, gates turn off and on at different times Momentarily get false outputs F A’ B A C ECEn/CS 224

Hazard-Free Logic Design Make sure all prime implicants overlap A’ g1 B A g2 F C Redundant but will eliminate false output B C g3 F = A’B + AC + BC On ABC = ‘111’ to ABC = ‘011’, g3 will hold F high entire time. ECEn/CS 224

No False Output… F A’ B=1 A C=1 g1 g2 g3 A g1 g2 g3 F ECEn/CS 224

This is not hazard-free Another Example Rule: No 2 adjacent 1’s should be in different implicants F = CD + AC’ F = CD + AC’ + AD This is not hazard-free This is hazard-free ECEn/CS 224

When To Do Hazard-Free Design? When you need to generate a signal which will not glitch Interfacing with other circuitry which is sensitive to edges Asynchronous memories Will only work for single-input changes Other techniques for multiple-input changes ECEn/CS 224