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.

Slides:



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

Boolean Algebra and Reduction Techniques
Chapter 2 – Combinational Logic Circuits Part 1 – Gate Circuits and Boolean Equations Logic and Computer Design Fundamentals.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
Digital Fundamentals Floyd Chapter 4 Tenth Edition

EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Digital Fundamentals with PLD Programming Floyd Chapter 4
Computer Programming Skills Revision Prepared by: Ghader Kurdi.
Boolean Algebra. Introduction 1854: Logical algebra was published by George Boole  known today as “Boolean Algebra” 1854: Logical algebra was published.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
Digital Logic Design ESGD2201
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.
Boolean Algebra and Logic Simplification
CHAPTER 2 Boolean Algebra
ECE 331 – Digital System Design
 Seattle Pacific University EE Logic System DesignSOP-POS-1 The Connection: Truth Tables to Functions abcF abcF
Ahmad Almulhem, KFUPM 2009 COE 202: Digital Logic Design Combinational Logic Part 2 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
6 - 1 Simplification Theorems Useful for simplification of expressions & therefore simplification of the logic network which results. XY + XY' = ( X +
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 6 – Canonical Forms.
Boolean Logic 1 Technician Series Boolean 1.1 ©Paul Godin Created Jan 2015 gmail.com.
Digital Logic Design Week 4 Boolean algebra. Laws and rules De Morgan’s theorem Analysis of logic circuits Standard forms Project 1 preparation.
CH41 Chapter 4 Boolean Algebra and Logic Simplification By Taweesak Reungpeerakul.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 3.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
Boolean Algebra and Reduction Techniques
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
© BYU 03 BA1 Page 1 ECEn 224 Boolean Algebra – Part 1.
Module –I Switching Function
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 © 2008 Pearson Education.
Chapter 2 Boolean Algebra and Minimization Techniques.
Sum-of-Products (SOP)
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
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
Digital Logic Design Dr. Oliver Faust Chapter 4
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 Binary Numbers For digital systems, the.
Logic Simplification-Using K-Maps
1 3- De-Morgan’s Theorems 1.The complement of a product of variables is equal to the sum of the complements of the variables. 2. The complement of a sum.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
Introduction to Digital Electronics Lecture 5: Function Minimisation.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
DE MORGAN’S THEOREM. 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.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Dr. ClincyLecture Slide 1 CS Chapter 3 (3A and ) Part 2 of 8 Dr. Clincy Professor of CS.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Introduction to Digital Electronics Lecture.
Boolean Algebra How gates get picked. Boolean Arithmetic Boolean ≠ Binary – Boolean – 1/0 only, no places Boolean addition:
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
De Morgan’s Theorem,.
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
Boolean Algebra & De Morgan's Theorems
CHAPTER 2 Boolean Algebra
CHAPTER 1 : INTRODUCTION
Boolean Algebra.
TN 221: DIGITAL ELECTRONICS 1
ECE 331 – Digital System Design
BASIC & COMBINATIONAL LOGIC CIRCUIT
Boolean Algebra.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Digital Fundamentals Floyd Chapter 4 Tenth Edition
Laws & Rules of Boolean Algebra
Boolean Algebra S.SADHISH PRABHU.
Presentation transcript:

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 DeMorgan’s second theorem to gates:

Apply DeMorgan’s theorem to remove the overbar covering both terms from the expression X = C + D. DeMorgan’s Theorem To apply DeMorgan’s theorem to the expression, you can break the overbar covering both terms and change the sign between the terms. This results in X = C. D. Deleting the double bar gives X = C. D. =

Find the complement of the following function DeMorgan’s Theorem

Boolean Analysis of Logic Circuits Combinational logic circuits can be analyzed by writing the expression for each gate and combining the expressions according to the rules for Boolean algebra. Apply Boolean algebra to derive the expression for X. Write the expression for each gate: Applying DeMorgan’s theorem and the distribution law: C ( A + B ) = C ( A + B ) + D ( A + B ) X = C (A B) + D = A B C + D X

SOP and POS forms Boolean expressions can be written in the sum-of-products form (SOP) or in the product-of-sums form (POS). These forms can simplify the implementation of combinational logic, particularly with PLDs. In both forms, an overbar cannot extend over more than one variable. An expression is in SOP form when two or more product terms are summed as in the following examples: An expression is in POS form when two or more sum terms are multiplied as in the following examples: A B C + A B A B C + C DC D + E (A + B)(A + C) (A + B + C)(B + D) (A + B)C

SOP Standard form In SOP standard form, every variable in the domain must appear in each term. This form is useful for constructing truth tables or for implementing logic in PLDs. You can expand a nonstandard term to standard form by multiplying the term by a term consisting of the sum of the missing variable and its complement. Convert X = A B + A B C to standard form. The first term does not include the variable C. Therefore, multiply it by the (C + C), which = 1: X = A B (C + C) + A B C = A B C + A B C + A B C

POS Standard form In POS standard form, every variable in the domain must appear in each sum term of the expression. You can expand a nonstandard POS expression to standard form by adding the product of the missing variable and its complement and applying rule 12, which states that (A + B)(A + C) = A + BC. Convert X = (A + B)(A + B + C) to standard form. The first sum term does not include the variable C. Therefore, add C C and expand the result by rule 12. X = (A + B + C C)(A + B + C) = (A +B + C )(A + B + C)(A + B + C)