Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education.

Slides:



Advertisements
Similar presentations
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Advertisements

Instructor Dr Sameh Abdulatif
Boolean Algebra and Reduction Techniques
Boolean Algebra and Combinational Logic
Digital Fundamentals Floyd Chapter 4 Tenth Edition
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Digital Fundamentals with PLD Programming Floyd Chapter 4
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
Floyd Digital Fundamentals, 9/e Copyright ©2006 by Pearson Education, Inc. Upper Saddle River, New Jersey All rights reserved. Slide 1 Digital Fundamentals.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 WEEK #7 COMBINATIONAL LOGIC ANALYSIS.
LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Basic Gates 3.1 Basic Digital Logic: NAND and NOR Gates ©Paul Godin Created September 2007 Last Update Sept 2009.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
Digital Fundamentals Floyd Chapter 3 Tenth Edition
Combinational Logic Digital Design Department of Software Development Faculty of Information Technology Islamic University of Gaza Dr. Rebhi Baraka
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Pp244 In Sum-of-Products (SOP) form, basic.
Boolean Algebra and Reduction Techniques
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 © 2008 Pearson Education.
Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,
DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
C.S. Choy21 BOOLEAN ALGEGRA The Mathematics of logic Boolean variables have only two possible values (binary) Operators:. Product+ SumComplement A.B A+B.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Binary Numbers For digital systems, the.
CHAPTER 5 Combinational Logic Analysis
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
Introduction to Digital Electronics Lecture 5: Function Minimisation.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
1 Ch.3 Logic Gates and Boolean Algebra – Part 1
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Chapter 5 Combinational Logic 组合逻辑
Combinational Circuits Part 1
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Chapter 3 Notes – Part II Review Questions
De Morgan’s Theorem,.
Digital Fundamentals Floyd Chapter 5 Tenth Edition
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Digital Fundamentals Floyd Chapter 3 Tenth Edition
EI205 Lecture 5 Dianguang Ma Fall 2008.
CHAPTER 1 : INTRODUCTION
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
BASIC & COMBINATIONAL LOGIC CIRCUIT
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Digital Fundamentals Floyd Chapter 4 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Chapter 5 Combinational Logic Analysis
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Combinational Logic Circuit
Presentation transcript:

Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education

Outline 5-1 Basic Combinational Logic Circuits 5-2 Implementing Combinational Logic 5-3 The Universal Property of NAND and NOR Gates 5-4 Combinational Logic Using NAND and NOR Gates 5-5 Logic Circuit Operation with Pulse Waveform Inputs

Combinational Logic Circuits In Sum-of-Products (SOP) form, basic combinational circuits can be directly implemented with AND-OR combinations if the necessary complement terms are available.

Combinational Logic Circuits An example of an SOP implementation is shown. The SOP expression is an AND-OR combination of the input variables and the appropriate complements. SOP DE ABC A B C E D X = ABC + DE

Combinational Logic Circuits When the output of a SOP form is inverted, the circuit is called an AND- OR-Invert (AOI) circuit. The AOI configuration lends itself to product-of- sums (POS) implementation. An example of an AOI implementation is shown. The output expression can be changed to a POS expression by applying DeMorgan’s theorem twice. POS DE ABC A B C E D X = ABC + DEX = ABC + DE X = (A + B + C)(D + E) X = (ABC)(DE) AOI DeMorgan

Exclusive-OR Logic The truth table for an exclusive-OR gate is A B Notice that the output is HIGH whenever A and B disagree. The Boolean expression is The circuit can be drawn as X Symbols:

Exclusive-NOR Logic The truth table for an exclusive-NOR gate is A B Notice that the output is HIGH whenever A and B agree. The Boolean expression is The circuit can be drawn as X Symbols:

Floyd, Digital Fundamentals, 10 th ed For each circuit, determine if the LED should be on or off. (a) (b) (c) Circuit (a): XOR, inputs agree, output is LOW, LED is ON. Circuit (b): XNOR, inputs disagree, output is LOW, LED is ON. Circuit (c): XOR, inputs disagree, output is HIGH, LED is OFF.

Outline 5-1 Basic Combinational Logic Circuits 5-2 Implementing Combinational Logic 5-3 The Universal Property of NAND and NOR Gates 5-4 Combinational Logic Using NAND and NOR Gates 5-5 Logic Circuit Operation with Pulse Waveform Inputs

Implementing Combinational Logic Implementing a SOP expression is done by first forming the AND terms; then the terms are ORed together. Show the circuit that will implement the Boolean expression X = ABC + ABD + BDE. (Assume that the variables and their complements are available.) C A B E D B A B D Start by forming the terms using three 3-input AND gates. Then combine the three terms using a 3-input OR gate. X = ABC + ABD + BDE

Karnaugh Map Implementation For basic combinational logic circuits, the Karnaugh map can be read and the circuit drawn as a minimum SOP. A Karnaugh map is drawn from a truth table. Read the minimum SOP expression and draw the circuit. 1. Group the 1’s into two overlapping groups as indicated. 2.Read each group by eliminating any variable that changes across a boundary. B changes across this boundary C changes across this boundary 3.The vertical group is read A C. 4.The horizontal group is read AB. The circuit is on the next slide:

Floyd, Digital Fundamentals, 10 th ed Circuit: C A A C A +AB continued… X = The result is shown as a sum of products. It is a simple matter to implement this form using only NAND gates as shown in the text and following example. B

NAND Logic Convert the circuit in the previous example to one that uses only NAND gates. Recall from Boolean algebra that double inversion cancels. By adding inverting bubbles to above circuit, it is easily converted to NAND gates: C A B A C A +AB X =

Outline 5-1 Basic Combinational Logic Circuits 5-2 Implementing Combinational Logic 5-3 The Universal Property of NAND and NOR Gates 5-4 Combinational Logic Using NAND and NOR Gates 5-5 Logic Circuit Operation with Pulse Waveform Inputs

Universal Gates - NAND NAND gates are sometimes called universal gates because they can be used to produce the other basic Boolean functions. Inverter AND gate

Universal Gates - NAND OR gate NOR gate

Universal Gates - NOR NOR gates are also universal gates and can form all of the basic gates. Inverter OR gate

Universal Gates - NOR AND gate NAND gate

Outline 5-1 Basic Combinational Logic Circuits 5-2 Implementing Combinational Logic 5-3 The Universal Property of NAND and NOR Gates 5-4 Combinational Logic Using NAND and NOR Gates 5-5 Logic Circuit Operation with Pulse Waveform Inputs

Problem Reading NAND or NOR logic circuit diagram is too complicated!

Solution

bubble-to-bubble or nonbubble-to-nonbubble. Bubble-to-nonbubble

Solution bubble-to-bubble or nonbubble-to-nonbubble.

NOR Logic

Outline 5-1 Basic Combinational Logic Circuits 5-2 Implementing Combinational Logic 5-3 The Universal Property of NAND and NOR Gates 5-4 Combinational Logic Using NAND and NOR Gates 5-5 Logic Circuit Operation with Pulse Waveform Inputs

Pulsed Waveforms For combinational circuits with pulsed inputs, the output can be predicted by developing intermediate outputs and combining the result. For example, the circuit shown can be analyzed at the outputs of the OR gates: A B C D A B C D G1G1 G2G2 G3G3 G1G1 G2G2 G3G3

Pulsed Waveforms Alternatively, you can develop the truth table for the circuit and enter 0’s and 1’s on the waveforms. Then read the output from the table. A B C D A B C D G1G1 G2G2 G3G3 G3G3 Inputs A B C D Output X

Selected Keywords Universal gate Negative-OR Negative-AND Either a NAND or a NOR gate. The term universal refers to a property of a gate that permits any logic function to be implemented by that gate or by a combination of gates of that kind. The dual operation of a NAND gate when the inputs are active-LOW. The dual operation of a NOR gate when the inputs are active- LOW.