Circuit Simplification: DeMorgan’s Theorems

Slides:



Advertisements
Similar presentations
Boolean Algebra and Reduction Techniques
Advertisements

Boolean rules for simplification Dr. Ahmed Telba.
Circuit Simplification: Boolean Algebra
Chapter 5 Boolean Algebra and Reduction Techniques William Kleitz Digital Electronics with VHDL, Quartus® II Version Copyright ©2006 by Pearson Education,
Digital Logic Design ESGD2201
CHAPTER 2 Boolean Algebra
Circuit Simplification Truth Table  Minimized Logic Gates.
DeMorgan’s Theorems Digital Electronics. DeMorgan’s Theorems DeMorgan’s Theorems are two additional simplification techniques that can be used to simplify.
Boolean Algebra and Reduction Techniques
Logic Circuits Lecture 3 By Amr Al-Awamry. Basic Definitions Binary Operators  AND z = x y = x yz=1 if x=1 AND y=1  OR z = x + y z=1 if x=1 OR y=1 
Digital Logic Design Dr. Oliver Faust Chapter 4
DeMorgan’s Theorem DeMorgan’s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Introduction to Digital Electronics Lecture.
Binary Number System And Conversion
Introduction to Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Truth Tables & Logic Expressions
Unit 2 Boolean Algebra.
The Binary Number System and Conversions
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Gate Circuits and Boolean Equations
CHAPTER 2 Boolean Algebra
CHAPTER 1 : INTRODUCTION
Binary Number System And Conversion
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Binary Number System And Conversion
SLIDES FOR CHAPTER 2 BOOLEAN ALGEBRA
FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA
XOR, XNOR, and Binary Adders
CHAPTER 2 Boolean Algebra
Binary Number System And Conversion
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Instructor: Alexander Stoytchev
The Binary Number System and Conversions
Date of Birth Design Problem
BASIC & COMBINATIONAL LOGIC CIRCUIT
Combinational Logic Design Process
Instructor: Alexander Stoytchev
Boolean Algebra Digital Electronics
Karnaugh Mapping Karnaugh Mapping Digital Electronics
Circuit Simplification: Boolean Algebra
XOR, XNOR, & Binary Adders
Karnaugh Mapping Digital Electronics
AOI Design: Logic Analysis
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Binary Number System And Conversion
Karnaugh Mapping Karnaugh Mapping Digital Electronics
Instructor: Alexander Stoytchev
Date of Birth Design Problem
Karnaugh Mapping Digital Electronics
Boolean Algebra.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
AOI Logic Implementation
Universal Gate – NOR Universal Gate - NOR Digital Electronics
AOI Design: Logic Analysis
XOR, XNOR, and Binary Adders
AOI Design: Logic Analysis
Circuit to Truth Table to Logic Expression
Circuit Simplification: DeMorgan’s Theorems
XOR, XNOR, and Binary Adders
Truth Tables & Logic Expressions
Laws & Rules of Boolean Algebra
Circuit Simplification: DeMorgan’s Theorems
Binary Number System And Conversion
Binary Number System And Conversion
Boolean Algebra S.SADHISH PRABHU.
Presentation transcript:

Circuit Simplification: DeMorgan’s Theorems Digital Electronics  2,1 Introduction to AOI Logic Circuit Simplification: DeMorgan’s Theorems Digital Electronics © 2014 Project Lead The Way, Inc. Project Lead The Way, Inc. Copyright 2009

DeMorgan’s Theorems DeMorgan’s Theorems Digital Electronics  2,1 Introduction to AOI Logic DeMorgan’s Theorems are two additional simplification techniques that can be used to simplify Boolean expressions. Again, the simpler the Boolean expression, the simpler the resulting logic. Introductory Slide / Overview of Presentation Project Lead The Way, Inc. Copyright 2009

DeMorgan’s Theorems Augustus DeMorgan Digital Electronics  2,1 Introduction to AOI Logic My name is Augustus DeMorgan. I’m an Englishman born in India in 1806. I was instrumental in the advancement of mathematics and am best known for the logic theorems that bear my name. A little history… http://www.math.utep.edu/Faculty/mleung/probabilityandstatistics/chronology.htm Project Lead The Way, Inc. Copyright 2009

DeMorgan’s Theorem #1 Proof 1 1 DeMorgan’s Theorems Digital Electronics  2,1 Introduction to AOI Logic Proof Overview & proof of DeMorgan’s Theorem #1 1 1 The truth-tables are equal; therefore, the Boolean equations must be equal. Project Lead The Way, Inc. Copyright 2009

DeMorgan’s Theorem #2 Proof 1 1 DeMorgan’s Theorems Digital Electronics  2,1 Introduction to AOI Logic Proof Overview & proof of DeMorgan’s Theorem #2 1 1 The truth-tables are equal; therefore, the Boolean equations must be equal. Project Lead The Way, Inc. Copyright 2009

Summary Boolean & DeMorgan’s Theorems Commutative Law Associative Law Digital Electronics  2,1 Introduction to AOI Logic Boolean & DeMorgan’s Theorems Commutative Law Associative Law Distributive Law Updates of the Boolean Theorems with the addition of DeMorgan’s Consensus Theorem DeMorgan’s Project Lead The Way, Inc. Copyright 2009

DeMorgan Shortcut BREAK THE LINE, CHANGE THE SIGN DeMorgan’s Theorems Digital Electronics  2,1 Introduction to AOI Logic BREAK THE LINE, CHANGE THE SIGN Break the LINE over the two variables, and change the SIGN directly under the line. For Theorem #14A, break the line, and change the AND function to an OR function. Be sure to keep the lines over the variables. “Split and Switch” For Theorem #14B, break the line, and change the OR function to an AND function. Be sure to keep the lines over the variables. Project Lead The Way, Inc. Copyright 2009

DeMorgan’s: Example #1 Example DeMorgan’s Theorems DeMorgan’s: Example #1 Digital Electronics  2,1 Introduction to AOI Logic Example Simplify the following Boolean expression and note the Boolean or DeMorgan’s theorem used at each step. Put the answer in SOP form. Pause the presentation and allow students to complete the example. The solution is on the next slide. Project Lead The Way, Inc. Copyright 2009

DeMorgan’s: Example #1 Example DeMorgan’s Theorems Digital Electronics  2,1 Introduction to AOI Logic Example Simplify the following Boolean expression and note the Boolean or DeMorgan’s theorem used at each step. Put the answer in SOP form. Solution This slide includes a solution for example #1. If you print handouts, do not print this page. ; Theorem #14A ; Theorem #9 & #14B ; Theorem #9 ; Rewritten without AND symbols and parentheses Project Lead The Way, Inc. Copyright 2009

DeMorgan’s Theorems DeMorgan’s: Example #2 Digital Electronics  2,1 Introduction to AOI Logic So, where would such an odd Boolean expression come from? Take a look at the VERY poorly designed logic circuit shown below. If you were to analyze this circuit to determine the output function F2, you would obtain the results shown. Example Simplify the output function F2. Be sure to note the Boolean or DeMorgan’s theorem used at each step. Put the answer in SOP form. Pause the presentation and allow students to complete the example. The solution is on the next slide. Project Lead The Way, Inc. Copyright 2009

DeMorgan’s: Example #2 Solution ; Theorem #14A ; Theorem #9 DeMorgan’s Theorems Digital Electronics  2,1 Introduction to AOI Logic Solution ; Theorem #14A ; Theorem #9 ; Theorem #14B ; Rewritten without AND symbols This slide includes a solution for example #2. If you print handouts, do not print this page. Project Lead The Way, Inc. Copyright 2009