ECE 3110: Introduction to Digital Systems

Slides:



Advertisements
Similar presentations
Chapter 3 Gate-Level Minimization
Advertisements

Boolean Algebra and Logic Gates
CS370 – Spring 2003 Hazards/Glitches. Time Response in Combinational Networks Gate Delays and Timing Waveforms Hazards/Glitches and How To Avoid Them.
ECE C03 Lecture 71 Lecture 7 Delays and Timing in Multilevel Logic Synthesis Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Prof. Sin-Min Lee Department of Computer Science
Figure 4.1. The function f (x1, x2, x3) =  m(0, 2, 4, 5, 6).
1 Combinational Logic Network design Chapter 4 (continued ….)
ECE 3110: Introduction to Digital Systems Simplifying Sum of Products using Karnaugh Maps.
Boolean Algebra and Combinational Logic
ECE 331 – Digital System Design
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
1 EE 365 Combinational-Circuit Synthesis. 2 Combinational-Circuit Analysis Combinational circuits -- outputs depend only on current inputs (not on history).
Chapter 3 Simplification of Switching Functions
EE365 Adv. Digital Circuit Design Clarkson University Lecture #6
CHAPTER 3 Digital Logic Structures
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
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.
EECC341 - Shaaban #1 Lec # 7 Winter Combinational Circuit Minimization Canonical sum and product logic expressions do not provide a circuit.
Simplifying Boolean Expressions Using K-Map Method
Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization
CS 105 Digital Logic Design
Digital Logic Design Lecture # 7 University of Tehran.
1 COMBINATIONAL LOGIC One or more digital signal inputs One or more digital signal outputs Outputs are only functions of current input values (ideal) plus.
Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
Digital Logic Basics Chapter 2 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 
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,
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
EE 261 – Introduction to Logic Circuits
Glitches/Hazards and ALUs
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
Unit 8 Combinational Circuit Design and Simulation Using Gates Fundamentals of Logic Design by Roth and Kinney.
ECE 3110: Introduction to Digital Systems Symplifying Products of sums using Karnaugh Maps.
Karnaugh Maps ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
ece Parity Used to check for errors Can be either ODD or EVEN Left most bit used as the indicator For EVEN, insert a 0 or a 1 so as to make the.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
Lecture 11 Timing diagrams Hazards.
1 Gate Level Minimization EE 208 – Logic Design Chapter 3 Sohaib Majzoub.
Circuit Minimization.
ENGG 340 Midterm Review. Introduced the Concept of Variables and Functions Introduced the Concept of AND, OR, and NOT Introduced the Concept of Truth.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
ECE 171 Digital Circuits Chapter 9 Hazards Herbert G. Mayer, PSU Status 2/21/2016 Copied with Permission from prof. Mark PSU ECE.
IAY 0600 Digital Systems Design Timing and Post-Synthesis Verifications Hazards in Combinational Circuits Alexander Sudnitson Tallinn University of Technology.
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.
Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
1 Digital Design Debdeep Mukhopadhyay Associate Professor Dept of Computer Science and Engineering NYU Shanghai and IIT Kharagpur.
EECE 320 L8: Combinational Logic design Principles 1Chehab, AUB, 2003 EECE 320 Digital Systems Design Lecture 8: Combinational Logic Design Principles.
©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.
IAY 0600 Digital Systems Design
Lecture 11 Logistics Last lecture Today HW4 due on Wednesday PLDs
Chapter 4. Combinational Logic Design Principles
CSC205 Jeffrey N. Denenberg Lecture #5
ECE 2110: Introduction to Digital Systems
Topic7: Timing Hazards José Nelson Amaral
ECE 3110: Introduction to Digital Systems
Boolean Algebra and Combinational Logic
Computer Architecture CST 250
Hazard.
IAY 0800 Digitaalsüsteemide disain
Introduction to Digital Systems
Hazard-free Karnaugh Map Minimisation
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Hazard-free Karnaugh Map Minimisation
Boolean Algebra and Gate Networks
Presentation transcript:

ECE 3110: Introduction to Digital Systems Multiple-outputs minimization Timing Hazards

Previous… PoS minimization Don’t care values

Multiple-Output Minimization Most digital applications require multiple outputs derived from the same input variables. Example: 3 inputs and 2 outputs Each output function could be minimized using K-map and realized independently. The output functions could share one or more product terms (prime implicant) which reduces the total number of gates. X F1 Y Logic Circuit F2 Z

Example F1= XZ+YZ’ F2=XY’+YZ’ To find the common terms multiply the two functions (F1.F2) The common terms are : YZ’, XY’Z XY X XY X 00 01 11 10 Z 00 01 11 10 Z 2 6 4 2 6 4 1 1 1 1 1 1 3 7 5 1 3 7 5 1 1 Z 1 1 Z 1 Y XY Y X Z 00 01 11 10 2 6 4 1 1 1 3 7 5 1 Z 1 Y

Example - Logic Diagram Independent realization Minimal realization F1= XZ+YZ’ F2= XY’+YZ’ F1 F1 X Y X F2 Z Y F2 Z

Real-World Logic Design More than 6 inputs -- can’t use Karnaugh maps Design correctness more important than gate minimization Use “higher-level language” to specify logic operations Use programs to manipulate logic expressions and minimize logic. PALASM, ABEL, CUPL -- developed for PLDs VHDL, Verilog -- developed for ASICs

Timing Hazards The Truth Table determines the Steady State behavior of a Combinational Logic Circuit Transient behavior: - Output could produce glitches (a short pulse) when input variables change. - Glitches occur when the paths between inputs and output have different delays. - Timing Hazards refer to the possibility of having glitches during input transitions. Hazards : - Definitions. - Finding hazards. - Eliminating hazards.

Definitions Static Hazards: * Static-1 Hazard : Two input combinations that : - differ in only one variable . - both produce logic 1 . - possibly produce Logic 0 glitch during input variable transition * Static-0 Hazard : Two input combinations that - differ in only one variable - Both produce logic 0 - Possibly produce Logic 1 glitch during input variable transition Dynamic hazards: - The output could change more than once during input transitions - Caused by multiple paths with different delays from input to the output 1 1

Example F= YZ+XZ’ Delay in each gate is T . Input changes from XYZ=111 to 110 X Y Z YZ Z’ XZ’ F T glitch Y F Z X

Finding Timing hazards using K-map Two-level AND-OR Circuits : Static 0 hazards do not exist in the sum-of products (AND-OR) implementation. Static 1 hazards are possible The K-map of the function F in the previous example : - Cell 6 ( 110 ) and cell 7 ( 111 ) are covered in two product terms XY X Faster 00 01 11 10 Z Y 1 1 0 2 6 4 F Z 1 0 1 1 0 1 1 0 1 1 3 7 5 1 X 1 1 1 Z Static 1 hazard Y

Timing hazards in OR-AND circuits Static 1 hazards do not exist in the Product-of sums (Two-level OR-AND) implementation. Static 0 hazards are possible The minimal product of F = ( X+Z)(Y+Z’) - Cell 0 ( 000 ) and cell 1 ( 001 ) are covered in two sum terms - Static 0 hazard occurs when inputs switched between 000 to 001 Faster XY X 00 01 11 10 X 0 1 Z F Z 0 1 2 6 4 1 0 1 1 0 1 0 Z Y 1 3 7 5 1 1 1 Static 0 hazard Y

Eliminating Timing Hazards AND-OR Circuit - Add a prime implicant that combines the two inputs that cause static 1 hazard.---->consensus - Cells 6 & 7 are combined : XY The hazard-free circuit is : XY X 00 01 11 10 Z Y 1 1 0 2 6 4 F 1 1 1 Z 1 0 1 1 3 7 5 1 1 1 1 Z X 1 0 1 1 Y

Eliminating Timing Hazards OR-AND Circuit - Add a prime implicant that combines the two inputs that cause static 0 hazard.---->consensus - Cells 0 & 1 are combined : X+Y The hazard-free circuit is : XY X 00 01 11 10 Z 2 6 4 X 0 1 1 1 F Z 0 1 Z 1 0 1 3 7 5 1 1 1 Y Y

Summary A properly designed two-level SOP (AND-OR) circuit has no static-0 hazards. It may have static-1 hazards. A properly designed two-level POS (OR-AND) circuit has no static-1 hazards. It may have static-0 hazards. Dynamic hazards do not occur in a properly designed two-level AND-OR or OR-AND circuit. It may occur in multilevel circuits. A brute-force method of obtaining a hazard-free realization is to use the complete sum or complete product. Hazard analysis and elimination are typically needed in the design of asynchronous sequential circuits.