© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.

Slides:



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

Floyd Digital Fundamentals, 9/e Copyright ©2006 by Pearson Education, Inc. Upper Saddle River, New Jersey All rights reserved. Slide 1 Digital Fundamentals.
EET 1131 Unit 3 Basic Logic Gates
Boolean rules for simplification Dr. Ahmed Telba.
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
Algebraic Properties: The Rules of Algebra Be Cool - Follow The Rules!
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Boolean Algebra. Introduction 1854: Logical algebra was published by George Boole  known today as “Boolean Algebra” 1854: Logical algebra was published.
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.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
© 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.
CHAPTER 2 Boolean Algebra
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.
Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Pp 92 Parity Method Pp 94 The parity method.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
Figure 4–1 Application of commutative law of addition. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by Pearson Education, Inc. Upper Saddle.
ALGEBRA READINESS Chapter 5 Section 6.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Pp244 In Sum-of-Products (SOP) form, basic.
Boolean 1.1 Boolean Logic 1 ©Paul Godin Created September 2007 Last Edit September 2009 gmail.com.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 © 2008 Pearson Education.
Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
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
Digital Logic Design Dr. Oliver Faust Chapter 4
PROPERTIES OF REAL NUMBERS. COMMUTATIVE PROPERTY OF ADDITION What it means We can add numbers in any order Numeric Example Algebraic Example
© 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.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
by D. Fisher (2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition 1.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
Introduction to Digital Electronics Lecture 5: Function Minimisation.
Axioms for Rational Numbers 9/14-9/15. Natural Numbers – Numbers used for counting: 1, 2, 3, and so on. Whole Numbers – Natural numbers and zero: 0, 1,
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Boolean Algebra. Laws of Boolean Algebra Commutative LawExpression Addition: A + B = B + A Multiplication: A B = B A Associative Addition: A + (B+C) =
© 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 Introduction to Digital Electronics Lecture.
Number Properties. Commutative Property of Addition Words: In a sum, you can add terms in any order. Numbers: 5 + (-6) Algebra: a + b b + a.
Boolean Operations and Expressions Addition = = = = 1 Multiplication 0 * 0 = 0 0 * 1 = 0 1 * 0 = 0 1 * 1 = 1.
De Morgan’s Theorem,.
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
Properties of Operations
CHAPTER 2 Boolean Algebra
CHAPTER 1 : INTRODUCTION
Properties of Real Numbers
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Boolean Algebra.
Boolean Expressions Lecture No. 10.
TN 221: DIGITAL ELECTRONICS 1
BASIC & COMBINATIONAL LOGIC CIRCUIT
Boolean Algebra.
Properties of Real Numbers
Boolean Algebra.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Properties of Real Numbers
Digital Fundamentals Floyd Chapter 4 Tenth Edition
Laws & Rules of Boolean Algebra
Boolean Algebra S.SADHISH PRABHU.
Presentation transcript:

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 Boolean Algebra and Logic Simplification © 2008 Pearson Education

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed In Boolean algebra a variable is a symbol used to represent an action, a condition, or data. A single variable can only have a value of 1 or 0. The complement represents the inverse of a variable and is indicated with an overbar. Thus, the complement of A is A. A literal is a variable or its complement.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Boolean Addition Addition is equivalent to the OR operation. The sum term is 1 if one or more if the literals are 1. The sum term is zero only if each literal is 0. Determine the values of A, B, and C that make the sum term of the expression A + B + C = 0? Each literal must = 0; therefore A = 1, B = 0 and C = 1.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Boolean Addition

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed In Boolean algebra, multiplication is equivalent to the AND operation. Boolean Multiplication

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Boolean Multiplication What are the values of the A, B and C if the product term of A. B. C = 1? Each literal must = 1; therefore A = 1, B = 0 and C = 0.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Commutative Laws In terms of the result, the order in which variables are ORed makes no difference. The commutative laws are applied to addition and multiplication. For addition, the commutative law states A + B = B + A

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Commutative Laws In terms of the result, the order in which variables are ANDed makes no difference. For multiplication, the commutative law states AB = BA

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Associative Laws When ORing more than two variables, the result is the same regardless of the grouping of the variables. The associative laws are also applied to addition and multiplication. For addition, the associative law states A + (B +C) = (A + B) + C

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Associative Laws For multiplication, the associative law states When ANDing more than two variables, the result is the same regardless of the grouping of the variables. A(BC) = (AB)C

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Distributive Law The distributive law is the factoring law. A common variable can be factored from an expression just as in ordinary algebra. That is AB + AC = A(B+ C) The distributive law can be illustrated with equivalent circuits: AB + ACA(B+ C)

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Rules of Boolean Algebra 1. A + 0 = A 2. A + 1 = 1 3. A. 0 = 0 4. A. 1 = 1 5. A + A = A 7. A. A = A 6. A + A = 1 8. A. A = 0 9. A = A = 10. A + AB = A 12. (A + B)(A + C) = A + BC 11. A + AB = A + B

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Rules of Boolean Algebra

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Rules of Boolean Algebra

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Rules of Boolean Algebra

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Rules of Boolean Algebra

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Rules of Boolean Algebra

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Rules of Boolean Algebra

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Rules of Boolean Algebra

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Rules of Boolean Algebra