CS 151 Digital Systems Design Lecture 32 Hazards

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
CS 151 Digital Systems Design Lecture 19 Sequential Circuits: Latches.
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.
K-Maps, Timing Sequential Circuits: Latches & Flip-Flops Lecture 4 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier,
Asynchronous Sequential Logic
1 Combinational Logic Network design Chapter 4 (continued ….)
Synchronous Digital Design Methodology and Guidelines
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
EE365 Adv. Digital Circuit Design Clarkson University Lecture #6
1 Exact Two-Level Minimization of Hazard-Free Logic with Multiple Input Changes Montek Singh Tue, Oct 16, 2007.
ECE C03 Lecture 61 Lecture 6 Delays and Timing in Multilevel Logic Synthesis Prith Banerjee ECE C03 Advanced Digital Design Spring 1998.

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 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
The covering procedure. Remove rows with essential PI’s and any columns with x’s in those rows.
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.
1 CSE370, Lecture 17 Lecture 17 u Logistics n Lab 7 this week n HW6 is due Friday n Office Hours íMine: Friday 10:00-11:00 as usual íSara: Thursday 2:30-3:20.
Glitches/Hazards and ALUs
Timing Diagrams Shows signal state (1 or 0) as a function of time Dependent variable (horizontal axis) used for time Independent variable (vertical axis)
Nonlinear & Neural Networks LAB. CHAPTER 8 Combinational Circuit design and Simulation Using Gate 8.1Review of Combinational Circuit Design 8.2Design of.
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.
Boolean Expressions Lecture 3 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
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.
CS151 Introduction to Digital Design Chapter 5: Sequential Circuits 5-1 : Sequential Circuit Definition 5-2: Latches 1Created by: Ms.Amany AlSaleh.
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.
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.
©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.
Lecture 11 Logistics Last lecture Today HW4 due on Wednesday PLDs
ECE 3110: Introduction to Digital Systems
K-map: Product-of-Sums Minimization
Lecture 8 Combinational Network Design and Issues
COMP211 Computer Logic Design Lecture 3. Combinational Logic 2
ECE 434 Advanced Digital System L03
332:437 Lecture 12 Finite State Machine Design
Hazard.
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
CSE 370 – Winter Sequential Logic - 1
Introduction to Digital Systems
Elec 2607 Digital Switching Circuits
Hazard-free Karnaugh Map Minimisation
Elec 2607 Digital Switching Circuits
Chapter 3 Overview • Multi-Level Logic
Hazard-free Karnaugh Map Minimisation
ECE 331 – Digital System Design
Presentation transcript:

CS 151 Digital Systems Design Lecture 32 Hazards Give qualifications of instructors: DAP teaching computer architecture at Berkeley since 1977 Co-athor of textbook used in class Best known for being one of pioneers of RISC currently author of article on future of microprocessors in SciAm Sept 1995 RY took 152 as student, TAed 152,instructor in 152 undergrad and grad work at Berkeley joined NextGen to design fact 80x86 microprocessors one of architects of UltraSPARC fastest SPARC mper shipping this Fall

Minimum sum of products implementation reduces costs Overview Minimum sum of products implementation reduces costs Propagation delays in circuits can lead to output glitches Hazards can be determined from K-map Technique using K-maps to avoid hazards Look for neighboring circles Hazards are less of a concern for sequential circuits. Combinational outputs settle prior to rising clock edge credential: bring a computer die photo wafer : This can be an hidden slide. I just want to use this to do my own planning. I have rearranged Culler’s lecture slides slightly and add more slides. This covers everything he covers in his first lecture (and more) but may We will save the fun part, “ Levels of Organization,” at the end (so student can stay awake): I will show the internal stricture of the SS10/20. Notes to Patterson: You may want to edit the slides in your section or add extra slides to taylor your needs.

There is a finite propagation delay through all gates. Combinational Delay Logic gates do not produce an output simultaneously with a change in input. There is a finite propagation delay through all gates. input output input output time propagation delay

Example of Combinational Hazards Eg. Q = AB’ + BD if B & D are 1 then Q should be 1 but because of propagation delays, if B changes state then Q will become unstable for a short time, as follows: A B D Q (C) Q goes low for a short time even though the function says that it should be independent of B when both A & D are high. A D B (C) Q High glitch

Hazards/glitches: unwanted switching at the outputs Occur when different paths through circuit have different propagation delays Dangerous if logic causes an action while output is unstable May need to guarantee absence of glitches Usual solutions 1) Wait until signals are stable (by using a clock): preferable (easiest to design when there is a clock – synchronous design) 2) Design hazard-free circuits

Types of Hazards Static 1-hazard Static 0-hazard Dynamic hazards Input change causes output to go from 1 to 0 to 1 Static 0-hazard Input change causes output to go from 0 to 1 to 0 Dynamic hazards Input change causes a double change from 0 to 1 to 0 to 1 OR from 1 to 0 to 1 to 0 1 1 1 1

Hazard Elimination Hazards like these are best eliminated logically. The Karnaugh Map of the required function gives one method. Covering the hazard causing the transition with a redundant product term (AD) will eliminate the hazard. The hazard free Boolean equation is: Q = AB’+BD+AD 00 01 11 10 0 0 0 0 1 1 0 1 1 1 D AB AB’ BD AD

Static Hazards Due to a literal and its complement momentarily taking on the same value Thru different paths with different delays and reconverging May cause an output that should have stayed at the same value to momentarily take on the wrong value Example F A B S S' hazard static-0 hazard static-1 hazard

Due to the same versions of a literal taking on opposite values Dynamic Hazards Due to the same versions of a literal taking on opposite values Thru different paths with different delays and reconverging May cause an output that was to change value to change 3 times instead of once Example: A C A C B F 1 2 3 B1 B2 B3 F hazard dynamic hazards

Hazard Example Logic gates do not produce an output simultaneously with a change in input. There is a finite propagation delay through all gates.

Hazard Removal for Static 0 Locate boundaries between circles Add an extra circle (product term) to eliminate hazard Note: addition of term does not lead to minimum sum of products implementation.

Hazard Removal Result Addition of extra AND gate and extra OR gate input Generally does not slow down circuit Not as important for sequential circuits

When inputs change, intermediate values created Summary When inputs change, intermediate values created Could lead to incorrect circuit behavior Hazards can be determined from K-map Technique using K-maps to avoid hazards Use additional implicants Hazards not as important for sequential design Hazard removal requires additional hardware credential: bring a computer die photo wafer : This can be an hidden slide. I just want to use this to do my own planning. I have rearranged Culler’s lecture slides slightly and add more slides. This covers everything he covers in his first lecture (and more) but may We will save the fun part, “ Levels of Organization,” at the end (so student can stay awake): I will show the internal stricture of the SS10/20. Notes to Patterson: You may want to edit the slides in your section or add extra slides to taylor your needs.