AV-213

DIGITAL SYSTEMS – LOGIC DESIGN &

DEVICES
Lecture No 5

“BOOLEAN ALGEBRA”
Text Book: Chapter 2
Section: 2-2

Instructor: Sqn Ldr Majid Khan

Number of Slides: 26

Avionics Engineering Department

 Class Objectives
• Boolean Algebra
• Basic Identities
• Algebraic Simplification
• Boolean Algebra Theorems
• Dual of a Function
• Complement of a Function

2
 Boolean Algebra
• Boolean Algebra
– Algebra of Boolean variables
– deals with binary variables and logic operations
• variables designated by alphabets
• logic operations are AND, OR, NOT

• Boolean Function
– express logical relationship between Boolean variables
F  X  YZ
• binary variable F denotes the function
• algebraic expression of binary variables X, Y, Z
• F is equal to 1 if either of two terms is equal to 1

3
 Truth Table, Logic Diagram
& Boolean Expression
• A Boolean function can be represented by:
– Boolean Equation
– Truth Table
– Logic Diagram

• Truth table is unique…

• Boolean expression & logic diagram have alternatives…!!

– expression can be simplified to give alternate expressions
– each expression results in a different logic diagram

helps to find less costly hardware implementation –

in terms of gates/literals
4
 Truth Table Representation

• A Boolean Function can be represented in Truth Table

• Truth table lists all possible

Truth Table
combinations of 1’s and 0’s that can
XYZ F = X + YZ
be assigned to binary variables
000 0
– n i/p variables → 2n rows
001 1
• Shows function values for 010 0
each combination 011 0
100 1
Truth table for Boolean equation : 101 1
110 1
F  X  YZ
111 1

5
 Logic Diagram
• Boolean Function can be represented by Logic Diagram
– composed of logic gates
– inputs are variables of the function F
– output is the binary variable F
Logic Diagram
X
Equation :
Y F
F  X YZ
Z

Combinational Logic Circuit

• variables combined by logic operations
• o/p at any point in time depends on the combination of i/p values
6
 Basic Identities
• Basic identities can be used to simplify Boolean expressions for
easier & less costly circuit implementations

7
 Properties of Identities & Boolean
Algebra
• If the meaning is unambiguous, we leave out symbol “·”
• Identities are organized as pairs
– pairs form duals of each other
Dual of Algebraic Expression
obtained by interchanging AND and OR,
and 0’s and 1’s

8
 Algebraic Manipulation
• Algebraic manipulation can simplify circuits…

F  XYZ  XY Z  XZ

Distributive Law

Identity 2 (Y.1 = Y)
9
 Algebraic Manipulation
• Simplified circuit has less number of gates…

• The simplified Boolean expression has reduced:

– terms from 3 to 2
– literals from 8 to 4 F  XYZ  XY Z  XZ
 XY  XZ

10
 Algebraic Manipulation
• Both functions have same truth table …

F XYZ  XY Z  XZ  XY  XZ

11
 Boolean Operator Precedence
• The order of evaluation in a Boolean expression is:
– Parenthesis
– NOT
– AND
– OR
• Consequence:
– Parentheses appear around OR expressions
• Example:
A( B  C )(C  D)

12
 Useful Theorems
• A number of theorems can be used to simplify Boolean
expressions

Absorption
Minimization
Simplification

• Left and Right theorems are dual of each other

• Doing proofs of theorems can allow to learn selecting

appropriate theorem and its efficient use
13
Absorption Theorem (Proof)

14
Minimization Theorem (Proof)

15
Simplification Theorem (Proof)

16
 Consensus Theorem

The 3rd term is redundant and can be eliminated.

17
Consensus Theorem (Dual)

Proof
Do it yourselves!

18
 Expression Simplification

Simplify the Boolean expression ( A  B)( A  C )

19
 Expression Simplification
• Example: Simplify the expression in terms of the number of
terms and literals
(both complemented and un-complemented variables)

AB  ACD  ABD  AC D  ABCD

 AB  ABCD  ACD  AC D  ABD
 AB (1  CD)  AC ( D  D )  ABD
 AB (1)  AC (1)  ABD
 AB  AC  ABD
 B ( A  AD)  AC
 B ( A  D)  AC  AB  AD  AC

20
 Complement of Function
• Truth Table: interchange 1’s to 0’s and 0’s to 1’s
• Algebraic: use De-Morgan's Theorem
• Generalized Form : take the dual & complement each literal

Example: Using De-Morgan’s Laws

21
 Complement of Function
• Example: Using dual
– take the dual of the function and complement each literal
(Dual: interchange AND & OR, and 1’s & 0’s)

Function : F1  XY Z  XY Z  ( XY Z )  ( XY Z )
Dual of F1 : ( X  Y  Z )( X  Y  Z )
Complement literals : F 1  ( X  Y  Z )( X  Y  Z )

Function : F2  X (Y Z  YZ )  X ((Y Z )  (YZ ))

Dual of F2 : X  (Y  Z )(Y  Z )
Complement literals : F 2  X  (Y  Z )(Y  Z )
22
 Duals & Duality Principle
• Dual of an expression does not equal the original expression
– an expression cannot be replaced by its dual

Duality Principle of Boolean Algebra

Boolean equation remains valid if we take dual
on both sides of equal sign

Example: F = (A + C) · B + 0
dual F = (A · C) + B · 1 = AC + B

Example: H=A·B+A·C +B·C

dual H = (A + B) . (A + C) . (B + C)
= (A + B)(A + C)(B + C)
23
SUMMARY

24
QUESTIONS ?

25
 NEXT TIME

• Standard Forms
• Two Level Circuit Optimization

26