©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.

Slides:



Advertisements
Similar presentations
The scale of IC design Small-scale integrated, SSI: gate number usually less than 10 in a IC. Medium-scale integrated, MSI: gate number ~10-100, can operate.
Advertisements

CS370 – Spring 2003 Hazards/Glitches. Time Response in Combinational Networks Gate Delays and Timing Waveforms Hazards/Glitches and How To Avoid Them.
Logical Systems Synthesis.
ECE 3110: Introduction to Digital Systems
©2004 Brooks/Cole FIGURES FOR CHAPTER 5 KARNAUGH MAPS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter in the.
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.
EECC341 - Shaaban #1 Lec # 8 Winter Combinational Logic Circuit Transient Vs. Steady-state Output Gate propagation delay: The time between.
Chapter 3 Simplification of Switching Functions
ECE C03 Lecture 61 Lecture 6 Delays and Timing in Multilevel Logic Synthesis Prith Banerjee ECE C03 Advanced Digital Design Spring 1998.

ECE 331 – Digital System Design Multi-level Logic Circuits and NAND-NAND and NOR-NOR Circuits (Lecture #8) The slides included herein were taken from the.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Unit 8 Combinational Circuit Design and Simulation Using Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science.
Unit 8 Combinational Circuit Design and Simulation Using Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science.
©2010 Cengage Learning SLIDES FOR CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES This chapter in the book includes: Objectives Study Guide 7.1Multi-Level.
ECE 331 – Digital System Design Power Dissipation and Additional Design Constraints (Lecture #14) The slides included herein were taken from the materials.
Digital Logic Design Lecture # 7 University of Tehran.
Logic Design A Review. Binary numbers Binary numbers to decimal  Binary 2 decimal  Decimal 2 binary.
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, 
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,
Copyright © 2004 by Miguel A. Marin1 COMBINATIONAL CIRCUIT SYNTHESIS CLASSIC TWO-LEVEL CIRCUIT SYNTHESIS MULTILEVEL-CIRCUIT SYNTHESIS FACTORIZATION DECOMPOSITION.
Chapter 3: Digital Logic Dr Mohamed Menacer Taibah University
Glitches/Hazards and ALUs
Unit 8 Combinational Circuit Design and Simulation Using Gates Fundamentals of Logic Design by Roth and Kinney.
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
Nonlinear & Neural Networks LAB. CHAPTER 8 Combinational Circuit design and Simulation Using Gate 8.1Review of Combinational Circuit Design 8.2Design of.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
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.
UNIT 8 COMBINATIONAL CIRCUIT DESIGN AND SIMULATION USING GATES
©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 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use.
UNIT 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
©2010 Cengage Learning SLIDES FOR CHAPTER 6 QUINE-McCLUSKEY METHOD Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
©2010 Cengage Learning SLIDES FOR CHAPTER 5 KARNAUGH MAPS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Boolean Algebra & Logic Gates
SLIDES FOR CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
CHAPTER 3 Simplification of Boolean Functions
Lecture 11 Logistics Last lecture Today HW4 due on Wednesday PLDs
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
ECE 3110: Introduction to Digital Systems
Lecture 8 Combinational Network Design and Issues
CS 352 Introduction to Logic Design
SLIDES FOR CHAPTER 12 REGISTERS AND COUNTERS
Digital Logic.
SLIDES FOR CHAPTER 2 BOOLEAN ALGEBRA
ECE 434 Advanced Digital System L03
Basics Combinational Circuits Sequential Circuits
Basics Combinational Circuits Sequential Circuits Ahmad Jawdat
CPE/EE 422/522 Advanced Logic Design L02
Lecture 4 Sums of Product Circuits Simplification
BASIC & COMBINATIONAL LOGIC CIRCUIT
Digital Logic & Design Dr. Waseem Ikram Lecture 13.
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
Lecture 13 Logistics Last lecture Today HW4 up, due on Wednesday PLDs
CH7 Multilevel Gate Network
CSE 370 – Winter Combinational Implementation - 1
Introduction to Digital Systems
Reading: Hambley Ch. 7 through 7.5
Hazard-free Karnaugh Map Minimisation
Chapter 3 Overview • Multi-Level Logic
This chapter in the book includes: Objectives Study Guide
Hazard-free Karnaugh Map Minimisation
ECE 331 – Digital System Design
Reading: Hambley Ch. 7 through 7.5
Presentation transcript:

©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 key to exit this chapter. This chapter in the book includes: Objectives Study Guide 8.1Review of Combinational Circuit Design 8.2Design Circuits with Limited Gate Fan-In 8.3Gate Delays and Timing Diagrams 8.4Hazards in Combinational Logic 8.5Simulation and Testing of Logic Circuits Problems Design Problems

©2010 Cengage Learning Design of Circuits with Limited Gate Fan-In In practical logic design problems, the maximum number of inputs on each gate (or the fan-in) is limited. If a two-level realization of a circuit requires more gate inputs than allowed, factoring the logic expression to obtain a multi-level realization is necessary. Section 8.2 (p. 220)

©2010 Cengage Learning Example 1 Section 8.2 (p. 220) First we find a minimum sum-of-products of f ′. Realize f (a, b, c, d) = Ʃ m(0, 3, 4, 5, 8, 9, 10, 14, 15) using three- input NOR gates

©2010 Cengage Learning Figure 8-1 Then the expression for f ′ is factored to reduce the maximum number of gate inputs to three and, then it is complemented. f ′ = b′d(a′c′ + ac) + a′c(b + d′) + abc′ f = [b + d′ + (a + c)(a′ + c′)][a + c′ + b′d] [a′ + b′ + c]

©2010 Cengage Learning Figure 8-2 Example 2 Realize the functions given in Figure 8-2, using only two-input NAND gates and inverters. If we minimize each function separately, the result is f 1 = b′c′ + ab′ + a′b f 2 = b′c′ + bc + a′b f 3 = a′b′c + ab + bc′

©2010 Cengage Learning Each function requires a three-input OR gate, so we will factor to reduce the number of gate inputs: The second expression for f 2 has a term common to f 1, so we will choose the second expression. We can eliminate the remaining three-input gate from f 3 by noting that f 1 = b′(a + c′) + a′b f 2 = b(a′ + c) + b′c′or f 2 = (b′ + c)(b + c′) + a′b f 3 = a′b′c + b(a + c′) a′b′c = a′(b′c) = a′(b + c′)′

©2010 Cengage Learning Figure 8-3: Realization of Figure 8-2

©2010 Cengage Learning Gate Delays and Timing Diagrams When the input to a logic gate is changed, the output will not change instantaneously. The transistors or other switching elements within the gate take a finite time to react to a change in input, so that the change in the gate output is delayed with respect to the input change. Section 8.3 (p. 222)

©2010 Cengage Learning Figure 8-4: Propagation Delay in an Inverter

©2010 Cengage Learning Figure 8-5: Timing Diagram for AND-NOR Circuit

©2010 Cengage Learning Figure 8-6: Timing Diagram for Circuit with Delay

©2010 Cengage Learning Hazards in Combinational Logic When the input to a combinational circuit changes, unwanted switching transients may appear in the output. These transients occur when different paths from input to output have different propagation delays. Section 8.4 (p. 224)

©2010 Cengage Learning Figure 8-7: Types of Hazards

©2010 Cengage Learning We can detect hazards in a two-level AND-OR circuit using the following procedure: 1.Write down the sum-of-products expression for the circuit. 2.Plot each term on the map and loop it. 3.If any two adjacent 1′s are not covered by the same loop, a 1- hazard exists for the transition between the two 1′s. For an n- variable map, this transition occurs when one variable changes and the other n – 1 variables are held constant.

©2010 Cengage Learning Figure 8-8: Detection of a 1-Hazard

©2010 Cengage Learning Figure 8-9: Circuit with Hazard Removed

©2010 Cengage Learning Figure 8-10: Detection of a Static 0-Hazard

©2010 Cengage Learning Figure 8-11: Karnaugh Map Removing Hazards of Figure 8-10

©2010 Cengage Learning To design a circuit which is free of static and dynamic hazards, the following procedure may be used: 1.Find a sum-of-products expression (F t ) for the output in which every pair of adjacent 1′s is covered by a 1-term. (The sum of all prime implicants will always satisfy this condition.) A two- level AND-OR circuit based on this F t will be free of 1-, 0-, and dynamic hazards. 2.If a different form of the circuit is desired, manipulate F t to the desired form by simple factoring, DeMorgan′s laws, etc. Treat each x i and x i ′ as independent variables to prevent introduction of hazards.

©2010 Cengage Learning Simulation and Testing of Logic Circuits An important part of the logic design process is verifying that the final design is correct and debugging the design if necessary. Logic circuits may be tested either by actually building them or by simulating them on a computer. Simulation is generally easier, faster, and more economical. As logic circuits become more and more complex, it is very important to simulate a design before actually building it. Section 8.5 (p. 229)

©2010 Cengage Learning A simple simulator for combinational logic works as follows: 1.The circuit inputs are applied to the first set of gates in the circuit, and the outputs of those gates are calculated. 2.The outputs of the gates which changed in the previous step are fed into the next level of gate inputs. If the input to any gate has changed, then the output of that gate is calculated. 3.Step 2 is repeated until no more changes in gate inputs occur. The circuit is then in a steady-state condition, and the outputs may be read. 4.Steps 1 through 3 are repeated every time a circuit input changes.

©2010 Cengage Learning Figure 8-12 The bottom gate has no connection to one of its inputs. Because that gate has a 1 input and a hi-Z input, we do not know what the hardware will do, and the gate output is unknown.

©2010 Cengage Learning Four-Valued Logic Simulation Definition of variables in four-valued logic simulation: 0: Logic Low 1: Logic High X: Unknown Z: High Impedance (also known as hi-Z, an open circuit) Section 8.5 (p. 230)

©2010 Cengage Learning Table 8-1. AND and OR Functions for Four-Valued Simulation

©2010 Cengage Learning If a circuit output is wrong for some set of input values, this may be due to several possible causes: 1.Incorrect design 2.Gates connected wrong 3.Wrong input signals to the circuit If the circuit is built in lab, other possible causes include: 4.Defective gates 5.Defective connecting wires Possible Causes for an Incorrect Output

©2010 Cengage Learning Figure 8-13: Logic Circuit with Incorrect Output Suppose we build the following circuit in a simulator and set A = B = C = D = 1, the output F should be 0, but as seen in the diagram, it is 1. How do we determine why the output is incorrect? Example

©2010 Cengage Learning The reason for the incorrect value of F can be determined as follows: Figure 8-13: Logic Circuit with Incorrect Output 1.The output of gate 7 (F) is wrong, but this wrong output is consistent with the inputs to gate 7, that is, = 1. Therefore, one of the inputs to gate 7 must be wrong.

©2010 Cengage Learning Figure 8-13: Logic Circuit with Incorrect Output 2.In order for gate 7 to have the correct output (F = 0), both inputs must be 0. Therefore, the output of gate 5 is wrong. However, the output of gate 5 is consistent with its inputs because = 1. Therefore, one of the inputs to gate 5 must be wrong.

©2010 Cengage Learning Figure 8-13: Logic Circuit with Incorrect Output 3.Either the output of gate 3 is wrong, or the A or B input to gate 5 is wrong. Because C′D + CD ′ = 0, the output of gate 3 is wrong. 4.The output of gate 3 is not consistent with the outputs of gates 1 and 2 because ≠ 1. Therefore, either one of the inputs to gate 3 is connected wrong, gate 3 is defective, or one of the input connections to gate 3 is defective.

©2010 Cengage Learning Figure 8.14: Circuit Driving Seven-Segment Module The seven-segment indicator can be used to display any one of the decimal digits 0 through 9. For example, “1” is displayed by lighting segments 2 and 3. Seven-Segment Indicator