Presentation is loading. Please wait.

Presentation is loading. Please wait.

Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. 1 Boolean Algebra (continued) UNIT 3.

Published byEdwina Norton Modified over 7 years ago

Similar presentations

Presentation on theme: "Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. 1 Boolean Algebra (continued) UNIT 3."— Presentation transcript:

1 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. 1 Boolean Algebra (continued) UNIT 3

2 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. 2 This chapter includes: 3.1Multiplying out and Factoring Expressions 3.2Exclusive-OR and Equivalence Operations 3.3The Consensus Theorem 3.4Algebraic Simplification of Switching Expressions 3.5Proving Validity of an Equation

3 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Learning Objectives 3 1. Apply the laws and theorems of Boolean algebra to to the manipulation of algebraic expressions to simplifying an expression, finding the complement of an expression and multiplying out and factoring an expression. 2. Prove any of the theorems using a truth table or give an algebraic proof. 3. Define the exclusive-OR and equivalence operations. State, prove, and use the basic theorems that concern these operations. 4. Use the consensus theorem to delete terms from and add terms to a switching algebra expression. 5. Given an equation, prove algebraically that it is valid or show that it is not valid.

4 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Multiplying out and Factoring Expressions Given an expression in product-of-sums form, the corresponding sum-of-products expression can be obtained by multiplying out, using the two distributive laws: In addition, the following theorem is very useful for factoring and multiplying out: 4

5 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Multiplying out and Factoring Expressions  In general, when we multiply out an expression, we should use (3-3) along with (3-1) and (3-2).  To avoid generating unnecessary terms when multiplying out, (3-2) and (3-3) should generally be applied before (3-1), and terms should be grouped to expedite their application. 5

6 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Multiplying out and Factoring Expressions Example 1: 6

7 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Multiplying out and Factoring Expressions Example 2:  By repeatedly applying (3-1), (3-2), and (3-3), any expression can be converted to a product-of-sums form. 7

8 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Multiplying out and Factoring Expressions Example 2 (continued): 8

9 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Exclusive-OR and Equivalence Operations Exclusive-OR (XOR) Operation: From left to right, (a) XOR truth table, (b) XOR definition, (c) XOR logic symbol. 9 (a) (b) (c)

10 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Exclusive-OR and Equivalence Operations  For exclusive-OR, X Y = 1 if and only if (iff) X = 1 or Y = 1, but not both.  The ordinary OR operation is sometimes called inclusive-OR because X + Y = 1 iff X = 1 or Y = 1, or both.  Exclusive OR can be expressed in terms of AND and OR. Because X Y = 1 iff X is 0 and Y is 1 or X is 1 and Y is 0, we can write X Y = XY + XY (3-6)  Derivation of (3-6) is on page 68. 10

11 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Exclusive-OR and Equivalence Operations Theorems for Exclusive-OR: 11

12 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Exclusive-OR and Equivalence Operations Equivalence Operation: From left to right, (a) Equivalence operation truth table, (b) Definition, (c) Logic symbols, equivalence and exclusive-NOR gates 12 (a) (b) (c)

13 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Exclusive-OR and Equivalence Operations Equivalence Operations:  For this operation, the output will be 1 iff X and Y have the same value. So,  Equivalence is the complement of the exclusive-OR operation. 13

14 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. The Consensus Theorem Consensus Theorem:  The consensus theorem is used to cancel out redundant terms in an expression and is stated below:  The term that is eliminated can be called the consensus term.  The dual form of the consensus theorem is: 14

15 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. The Consensus Theorem Example 3: 15

16 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. The Consensus Theorem Example 3 (continued): 16

17 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. The Consensus Theorem Example 3 (continued): 17

18 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Algebraic Simplification of Switching Expressions Ways to simplify switching expressions:  In addition to multiplying out and factoring, three basic ways of simplifying switching functions are:  combining terms  eliminating terms  eliminating literals 18

19 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Algebraic Simplification of Switching Expressions Combining Terms: 19

20 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Algebraic Simplification of Switching Expressions Eliminating Terms and Literals: 20

21 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Algebraic Simplification of Switching Expressions Example 4: Example 5- Adding Redundant Terms: 21

22 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Algebraic Simplification of Switching Expressions Example 6: 22

23 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Algebraic Simplification of Switching Expressions Example 7:  For a product-of-sums form instead of a sum- of-products form, the duals of the preceding theorems should be applied. 23

24 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Proving the Validity of an Equation Proving an equation is valid: To determine if an equation is valid, meaning valid for all combinations of values of the variables, several methods can be used: 1. Construct a truth table and evaluate both sides of the equation for all combinations of values of the variables. 2. Manipulate one side of the equation by applying various theorems until it is identical with the other side. 24

25 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Proving the Validity of an Equation Proving an Equation is valid (continued): 3. Reduce both sides of the equation independently to the same expression. 4. It is permissible to perform the same operation on both sides of the equation provided that the operation is reversible. 25

26 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Proving the Validity of an Equation To prove an equation is NOT valid:  To prove that an equation is not valid, it is sufficient to show one combination of values of the variables for which the two sides of the equation have different values. 1. First reduce both sides to a sum of products (or a product of sums). 2. Compare the two sides of the equation to see how they differ. 3. Then try to add terms to one side of the equation that are present on the other side. 4. Finally try to eliminate terms from one side that are not present on the other.  Whatever method is used, frequently compare both sides of the equation and let the difference between them serve as a guide for what steps to take next. 26

27 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Proving the Validity of an Equation Example 8: 27

28 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Proving the Validity of an Equation Example 9: 28

29 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Proving the Validity of an Equation Example 9 (continued): 29

30 Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. Proving the Validity of an Equation Cancellation Laws in Boolean Algebra: The cancellation law for ordinary algebra, where: If x+y=x+z then y=z Does not hold for Boolean algebra. The cancellation law for multiplication, where: If xy=xz then y=z Does not hold for Boolean algebra. However, the converses of these hold true: 30

Download ppt "Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. 1 Boolean Algebra (continued) UNIT 3."

Similar presentations

ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.

ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.
ECE 331 – Digital System Design

ECE 331 – Digital System Design
EE365 Boolean algebra Combinational-circuit analysis.

EE365 Boolean algebra Combinational-circuit analysis.
1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.

1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.
Logic Gate Level Combinational Circuits, Part 1. Circuits Circuit: collection of devices physically connected by wires to form a network Net can be: –

Logic Gate Level Combinational Circuits, Part 1. Circuits Circuit: collection of devices physically connected by wires to form a network Net can be: –
Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.

Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.

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.

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.
Section 12.1. Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract.

Section Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract.
طراحی مدارهای منطقی نیمسال دوم 92-93 دانشگاه آزاد اسلامی واحد پرند.

طراحی مدارهای منطقی نیمسال دوم دانشگاه آزاد اسلامی واحد پرند.
CHAPTER 2 Boolean Algebra

CHAPTER 2 Boolean Algebra
Digital Logic Basics Chapter 2 S. Dandamudi. 2003 To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 2003. 

Digital Logic Basics Chapter 2 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.

Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.
LOGIC GATES & TRUTH TABLE 350151 – Digital Circuit 1 Choopan Rattanapoka.

LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.
Combinational Logic 1.

Combinational Logic 1.
Dr. Eng. Farag Elnagahy Office Phone: 67967 King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.

Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
©2010 Cengage Learning CHAPTER 3 BOOLEAN ALGEBRA (continued) 3.1Multiplying Out and Factoring Expressions 3.2Exclusive-OR and Equivalence Operations 3.3The.

©2010 Cengage Learning CHAPTER 3 BOOLEAN ALGEBRA (continued) 3.1Multiplying Out and Factoring Expressions 3.2Exclusive-OR and Equivalence Operations 3.3The.
©2004 Brooks/Cole FIGURES FOR CHAPTER 3 BOOLEAN ALGEBRA (continued) Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.

©2004 Brooks/Cole FIGURES FOR CHAPTER 3 BOOLEAN ALGEBRA (continued) Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
1 BOOLEAN ALGEBRA Basic mathematics for the study of logic design is Boolean Algebra Basic laws of Boolean Algebra will be implemented as switching devices.

1 BOOLEAN ALGEBRA Basic mathematics for the study of logic design is Boolean Algebra Basic laws of Boolean Algebra will be implemented as switching devices.

Similar presentations

Ads by Google