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

Slides:



Advertisements
Similar presentations
ECE C03 Lecture 71 Lecture 7 Delays and Timing in Multilevel Logic Synthesis Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Advertisements

Glitches & Hazards.
ECE 3110: Introduction to Digital Systems
1 Fundamentals of Computer Science Sequential Circuits.
Module 12.  In Module 9, 10, 11, you have been introduced to examples of combinational logic circuits whereby the outputs are entirely dependent on the.
Chapter 9 Asynchronous Sequential Logic 9-1 Introduction Introduction 9-2 Analysis Procedure Analysis ProcedureAnalysis Procedure 9-3 Circuits With Latches.
Asynchronous Sequential Logic
1 Combinational Logic Network design Chapter 4 (continued ….)
1 Digital Design: State Machines Timing Behavior Credits : Slides adapted from: J.F. Wakerly, Digital Design, 4/e, Prentice Hall, 2006 C.H. Roth, Fundamentals.
RTL Hardware Design by P. Chu Chapter 161 Clock and Synchronization.
CS 151 Digital Systems Design Lecture 25 State Reduction and Assignment.
ECE 331 – Digital System Design
Contemporary Logic Design Multi-Level Logic © R.H. Katz Transparency No Chapter # 3: Multi-Level Combinational Logic 3.3 and Time Response.
Chapter # 3: Multi-Level Combinational Logic
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
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 –Selected Design Topics Part 3 – Asynchronous.
Asynchronous Sequential Logic
Chapter 3 Simplification of Switching Functions
David Culler Electrical Engineering and Computer Sciences
Asynchronous Machines
EE365 Adv. Digital Circuit Design Clarkson University Lecture #6
ECE C03 Lecture 61 Lecture 6 Delays and Timing in Multilevel Logic Synthesis Prith Banerjee ECE C03 Advanced Digital Design Spring 1998.

CS 151 Digital Systems Design Lecture 32 Hazards
Contemporary Logic Design Sequential Logic © R.H. Katz Transparency No Chapter #6: Sequential Logic Design Sequential Switching Networks.
ENGIN112 L25: State Reduction and Assignment October 31, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 25 State Reduction and Assignment.
A hazard is said to exist when a circuit has the possibility of producing such a glitch. 4.4 Timing Hazards ReturnNext Because of circuit delays, the transient.
Unit 8 Combinational Circuit Design and Simulation Using Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science.
ECE 331 – Digital System Design Power Dissipation and Additional Design Constraints (Lecture #14) The slides included herein were taken from the materials.
Chapter # 3: Multi-Level Combinational Logic
Digital Logic Design Lecture # 7 University of Tehran.
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
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,
ECE Advanced Digital Systems Design Lecture 12 – Timing Analysis Capt Michael Tanner Room 2F46A HQ U.S. Air Force Academy I n t e g r i.
© BYU 18 ASYNCH Page 1 ECEn 224 Handling Asynchronous Inputs.
Glitches/Hazards and ALUs
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.
Nonlinear & Neural Networks LAB. CHAPTER 8 Combinational Circuit design and Simulation Using Gate 8.1Review of Combinational Circuit Design 8.2Design of.
Combinational Hazards Brandon L Fernandes University of Southern California.
Lecture 11 Timing diagrams Hazards.
No. 3-1 Chapter # 3: Multi-Level Combinational Logic.
Synchronous Sequential Logic A digital system has combinational logic as well as sequential logic. The latter includes storage elements. feedback path.
Timing Behavior of Gates
ECE 171 Digital Circuits Chapter 9 Hazards Herbert G. Mayer, PSU Status 2/21/2016 Copied with Permission from prof. Mark PSU ECE.
Circuit Analyze  Combinational or Sequential logic schematics show the circuit’s hardware implementation and give us some knowledge about the functions.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
1 CS 352 Introduction to Logic Design Lecture 4 Ahmed Ezzat Multi-level Gate Circuits and Combinational Circuit Design Ch-7 + Ch-8.
©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.
©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.
Chapter 5 Combinational Logic 组合逻辑
Overview Part 1 – The Design Space
Lecture 11 Logistics Last lecture Today HW4 due on Wednesday PLDs
Topic7: Timing Hazards José Nelson Amaral
ECE 3110: Introduction to Digital Systems
Lecture 8 Combinational Network Design and Issues
ECE 434 Advanced Digital System L03
Hazard.
CPE/EE 422/522 Advanced Logic Design L02
IAY 0800 Digitaalsüsteemide disain
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
Introduction to Digital Systems
Hazard-free Karnaugh Map Minimisation
Chapter 3 Overview • Multi-Level Logic
Hazard-free Karnaugh Map Minimisation
ECE 331 – Digital System Design
Presentation transcript:

CS370 – Spring 2003 Hazards/Glitches

Time Response in Combinational Networks Gate Delays and Timing Waveforms Hazards/Glitches and How To Avoid Them Chapter Overview

Timing behavior of circuits is emphasized waveforms are useful to visualize what is happening Logic simulation can be used to create these waveforms Hazards : momentary change of signals at the outputs can be useful -- pulse shaping circuits can be a problem -- glitches: incorrect circuit operation Terms: gate delay -- time for change at input to cause change at output. rise time -- time for output to transition from low to high voltage fall time -- time for output to transition from high to low voltage Time Response in Combinational Networks

Pulse Shaping Circuit A'  A = 0 F is not always 0! 3 gate delays D remains high for three gate delays after A changes from low to high Time Response in Combinational Networks A B F C D

Another Pulse Shaping Circuit Initially undefined Close Switch Open Switch + AB CD Open Switch Resistor

Hazards/Glitches and How to Avoid Them Unwanted switching at the outputs Occur because delay paths through the circuit experience different propagation delays Danger if logic "makes a decision" while output is unstable OR hazard output controls an asynchronous input (these respond immediately to changes rather than waiting for a synchronizing signal called a clock) Solutions: wait until signals are stable (by using a clock) never use circuits with asynchronous inputs design hazard-free circuits (single-bit changes in the inputs) Time Response in Combinational Networks

Hazards/Glitches and How to Avoid Them Kinds of Hazards Input change causes output to go from 1 to 0 to 1 Input change causes output to go from 0 to 1 to 0 Input change causes a double change from 0 to 1 to 0 to 1 OR from 1 to 0 to 1 to 0 Time Response in Combinational Networks

Time Response in Combinational Circuits Glitch Example F = A' D + A C' input change within product term input change that spans product terms output changes from 1 to 0 to 1 G1 G2 G3 A \C \A D F G1 G2 G3 A \C \A D F ABCD = 1100 ABCD = 1101 G1 G2 G3 A \C \A D F G1 G2 G3 A \C \A D F ABCD = 1101 ABCD = 0101 (A is still 0) G1 G2 G3 A \C \A D F ABCD = 0101 (A is 1)

Time Response in Combinational Networks Glitch Example General Strategy: add redundant terms F = A' D + A C' becomes A' D + A C' + C' D This eliminates 1-hazard? How about 0-hazard? Re-express F in PoS form: F = (A' + C')(A + D) Glitch present! Add term: (C' + D) This expression is equivalent to the hazard-free SoP form of F

Time Response in Combinational Networks Glitch Example Start with expression that is free of static 1-hazards F = A C' + A' D + C' D F' = (A C' + A' D + C' D)' = (A' + C) (A + D') (C + D') = A C + A C D' + C D' + A' C D' + A' D' = A C + C D' + A' D' covers all the adjacent 0's in the K-map free of static-1 and static-0 hazards! Work with complement:

Time Response in Combinational Networks Static hazards Solution: Add redundant terms to insure all adjacent transitions are covered by terms F2 = A C' + A' D + C' D + A B + B D 1's hazards in F corrected in F2

Time Response in Combinational Networks Designing Networks for Hazard-free operation Simply place transient output function in a form that guarantees that all adjacent ones are covered by a term no term of the transient output function contains both a variable and its complement F(A,B,C,D) =  m(1,3,5,7,8,9,12,13,14,15) F = A B + A' D + B D + A C' + C' D = (A' + B + C') D + A (B + C') (factored by distributive law, which does not introduce hazards since it does not depend on the complementarity laws for its validity)

Time Response in Combinational Networks Dynamic Hazards Example with Dynamic Hazard Three different paths from B or B' to output ABC = 000, F = 1 to ABC = 010, F = 0 different delays along the paths: G1 slow, G4 very slow Handling dynamic hazards very complex Beyond our scope