dkt 122/3 - digital system i chapter 4a:boolean algebra and logic simplification) mohd ridzuan mohd...

36
DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor [email protected] 019-3806067

Upload: maurice-hood

Post on 06-Jan-2018

224 views

Category:

Documents


0 download

DESCRIPTION

After completing this section 4A-1,you should be able to:  Define variable  Define literal  Identify a sum term  Evaluate a sum term  Identify a product term  Evaluate a product term  Explain boolean addition  Explain boolean multiplication

TRANSCRIPT

Page 1: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

DKT 122/3 - DIGITAL SYSTEM IChapter 4A:Boolean Algebra and

Logic Simplification)Mohd ridzuan mohd nor

[email protected]

Page 2: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Outline Standard Forms of Boolean Expressions Boolean Operations & expression Laws & rules of Boolean algebra DeMorgan’s Theorems Boolean analysis of logic circuits Simplification using Boolean Algebra Standard forms of Boolean Expressions Boolean Expressions & truth tables The Karnaugh Map Karnaugh Map SOP minimization Karnaugh Map POS minimization 5 Variable K-Map Programmable Logic

Page 3: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

After completing this section 4A-1,you should be able to: Define variable Define literal Identify a sum term Evaluate a sum term Identify a product term Evaluate a product term Explain boolean addition Explain boolean multiplication

Page 4: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Boolean Addition 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 Literal is a variable or its complement. Addition is equivalent to the OR operation.The sum term is 1 if one or

more if the laterals are 1.the sum term is zero only if each literal is 0. Example: Ā+B+C¯= 0 Each literal must = 0;therefore A=1,B=0,C=1

Page 5: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Boolean multiplication In boolean algebra,multiplication is equivalent to the AND operation.The

product term will be 1 only if all of the literals are 1. Example: what are the values of the A,B and C if the product term of Ā.B.C =1 Each literals must =1;therefore A=0,B=1 and C=1

Page 6: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

After completing this section 4A-2,you should be able to: Apply the commutative laws of addition and multiplication Apply the associative laws of addition and multiplication Apply the distributive law Apply twelve basic rules of boolean algebra

Page 7: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Commutative Laws The commutative lawsare applied to addition and multiplication. For

addition, the commutative law states In terms of the result, the order in which variables are ORed makes no

difference. A + B = B + A For multiplication, the commutative law states In terms of the result, the order in which variables are ANDed makes no

difference. AB = BA

Page 8: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Associative Laws The associative laws are also applied to addition and multiplication. For

addition, the associative law states When ORing more than two variables, the result is the same regardless of

the grouping of the variables. A + (B +C)= (A + B)+ C 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

Page 9: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

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:

Page 10: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Rules of Boolean Algebra

Page 11: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Rules of Boolean Algebra

Page 12: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Rules of Boolean Algebra

Page 13: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Rules of Boolean Algebra

Page 14: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Rules of Boolean Algebra

Page 15: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

After completing this section 4A-3,you should be able to: State DeMorgan’s theorems Relate DeMorgan’s theorems to the equivalency of the NAND and

negative-OR gates and to the equivalency of the NOR and negative-AND gates

Apply DeMorgan’s theorems to the simplification of Boolean expressions

Page 16: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

DeMorgan’s Theorem

Page 17: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

DeMorgan’s Theorem

Page 18: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

DeMorgan’s Theorem

Page 19: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

After completing this section 4A-4,you should be able to: Determine the Boolean expression for combination of gates Evaluate the logic operation of a circuit from the Boolean expression Construct a truth table

Page 20: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Boolean Analysis of Logic Circuits

Page 21: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Boolean Analysis of Logic Circuits

Page 22: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Boolean Analysis of Logic Circuits

Page 23: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Standard Form of Boolean ExpressionAfter completing this section 4A-5,you should be able to: Identify a sum-of-products expression Determine the domain of boolean expression Convert any sum-of-product expression to a standard form

Page 24: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

SOP and POS forms

Page 25: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

SOP Standard form

Page 26: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

SOP Standard form

Page 27: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

SOP Standard form

Page 28: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

POS Standard form

Page 29: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

After completing this section 4A-6,you should be able to: Construct a karnaugh map for three or four variables Determine the binary value of each cell in a karnaugh map Determine the standard product term represented by each cell in a

karnaugh map Explain cell adjacency and identify adjacent cells

Page 30: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Karnaugh maps

Page 31: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Karnaugh maps

Page 32: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Karnaugh maps

Page 33: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Karnaugh maps

Page 34: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Karnaugh maps

Page 35: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

Karnaugh maps

Page 36: DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor 019-3806067

References