Lecture 11 Logistics Last lecture Today HW4 due on Wednesday PLDs

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
1 Combinational Logic Network design Chapter 4 (continued ….)
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
Asynchronous Sequential Logic
Chapter 3 Simplification of Switching Functions
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.

CS 151 Digital Systems Design Lecture 32 Hazards
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,
Glitches/Hazards and ALUs
CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers Mon, Oct 5 CEC 220 Digital Circuit Design Slide 1 of 20.
CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers Friday, February 14 CEC 220 Digital Circuit Design Slide 1 of 18.
CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers
Lecture 11 Timing diagrams Hazards.
ECE 171 Digital Circuits Chapter 9 Hazards Herbert G. Mayer, PSU Status 2/21/2016 Copied with Permission from prof. Mark PSU ECE.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
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.
©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 组合逻辑
Lecture 4 Logistics Last lecture --- Boolean algebra Today’s lecture
Combinational Logic Implementation
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
ECE 3110: Introduction to Digital Systems
K-map: Product-of-Sums Minimization
Lecture 8 Combinational Network Design and Issues
Digital Logic Design 1st Exam Solution
Lecture 9 Logistics Last lecture Today HW3 due Wednesday
COMP211 Computer Logic Design Lecture 3. Combinational Logic 2
ECE 434 Advanced Digital System L03
Hazard.
CPE/EE 422/522 Advanced Logic Design L02
BASIC & COMBINATIONAL LOGIC CIRCUIT
CSCE 211: Digital Logic Design
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.
Digital Logic & Design Dr. Waseem Ikram Lecture 13.
CSCE 211: Digital Logic Design
CSE 370 – Winter 2002 – Comb. Logic building blocks - 1
Lecture 6 Logistics Last lecture Today’s lecture HW2 due on Wednesday
Lecture 13 Logistics Last lecture Today HW4 up, due on Wednesday PLDs
Lecture 8 Logistics Last lecture Last last lecture Today
CSE 370 – Winter Combinational Implementation - 1
Lecture 15 Logistics Last lecture Today HW4 is due today
Introduction to Digital Systems
Elec 2607 Digital Switching Circuits
Lecture 10 Logistics Last lecture Today
Lecture 11 Logistics Last lecture Today HW3 due now
CSCE 211: Digital Logic Design
Hazard-free Karnaugh Map Minimisation
Lecture 9 Logistics Last lecture Last last lecture Today
CSCE 211: Digital Logic Design
CSE 370 – Winter 2002 – Comb. Logic building blocks - 1
Digital Fundamentals Floyd Chapter 4 Tenth Edition
Elec 2607 Digital Switching Circuits
Chapter 3 Overview • Multi-Level Logic
Overview Last lecture Timing; Hazards/glitches
Hazard-free Karnaugh Map Minimisation
Lecture 18 Logistics Last lecture Today HW5 due today (with extra 10%)
ECE 331 – Digital System Design
Chapter 2 Digital Design and Computer Architecture, 2nd Edition
Lecture 6 Logistics Last lecture Today’s lecture HW2 due on Wednesday
Presentation transcript:

Lecture 11 Logistics Last lecture Today HW4 due on Wednesday PLDs ROMs Multilevel logic Today Timing diagrams Hazards

The “WHY” slide Timing diagram Hazards Real gates have real delays and it is good to learn how to plot the information with respect to time. Hazards Different delays can cause some output to get glitches. If these glitches are used in the next level of calculation, it could cause miscalculation. It is good to know when that happens and how to fix it.

Timing diagram (aka waveforms) Shows time-response of circuits Can use as sideways truth table Example: F = A +BC 000 001 010 011 100 101 110 111

Timing diagrams Real gates have real delays Example: A' • A = 0 time Delays cause transient F=1 F A B C D time width of 3 gate delays

Example: F=A+BC in 2-level logic canonical sum-of-products B F1 A minimized sum-of-products F2 canonical product-of-sums F3 minimized product-of-sums F4

Timing diagram for F = A + BC Time waveforms for F1 – F4 are identical Except for timing hazards (glitches)

Hazards/glitches Hazards/glitches: Undesired output switching Occurs when different pathways have different delays Wastes power (wire switching consumes power) Causes circuit noise Dangerous if logic makes a decision while output is unstable Solutions Design hazard-free circuits Difficult when logic is multilevel Wait until signals are stable

Types of hazards Static 1-hazard Static 0-hazard Dynamic hazards Output should stay logic 1 Gate delays cause brief glitch to logic 0 Static 0-hazard Output should stay logic 0 Gate delays cause brief glitch to logic 1 Dynamic hazards Output should toggle cleanly Gate delays cause multiple transitions 1 1 1 1

Static hazards Often occurs when a literal and its complement momentarily assume the same value Through different paths with different delays Causes an (ideally) static output to glitch A multiplexer A A B S F S S' B F S' static-0 hazard

Timing diagram for F = A + BC Time waveforms for F1 – F4 are identical Except for timing hazards (glitches)

Example: F=A+BC in 2-level logic 1 C canonical sum-of-products B F1 A minimized sum-of-products F2 canonical product-of-sums F3 minimized product-of-sums F4

Timing diagram for F = A + BC Time waveforms for F1 – F4 are identical Except for timing hazards (glitches)

Example: F=A+BC in 2-level logic 1 C 1 canonical sum-of-products B F1 1 A minimized sum-of-products F2 canonical product-of-sums F3 minimized product-of-sums F4

Dynamic hazards Often occurs when a literal assumes multiple values Through different paths with different delays Causes an output to toggle multiple times A 3 A F C 2 B B1 1 B2 C B3 F Dynamic hazards Dynamic hazard

Eliminating static hazards (only in 2 level logic) Key idea: Glitches happen when a changing input spans separate K-map encirclements Example: 1101 to 0101 change can cause a static-1 glitch A AB F = AC' + A'D CD 00 01 11 10 00 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 1 1 1 1 A C' 01 F 1 1 D A' 11 D 1 C 10 B

Eliminating static hazards (con’t) Solution: Add redundant K-map encirclements Ensure that all single-bit changes are covered by same block First eliminate static-1 hazards: Use SOP form If need to eliminate static-0 hazards, use POS form A F = AC' + A'D + C'D AB 00 01 11 10 CD 00 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 A C' 01 D A' F 11 D C C' 10 D B

Summary of hazards We can eliminate static hazards in 2-level logic For single-bit changes Eliminating static hazards also eliminates dynamic hazards Hazards are a difficult problem Multiple-bit changes in 2-level logic are hard Static hazards in multilevel logic are harder Dynamic hazards in multilevel logic are harder yet CAD tools and simulation/testing are indispensable