Boolean Algebra & Logic

Simplification
Chapter 04
 Introduction
• In 1854,George Boole published a work titled
“An investigation of the law of though”. It was in
this publication that a “logic algebra” known as
“Boolean algebra “ was formulated.
• Boolean algebra is a convenient and systematic
way of expressing and analyzing the operation
of logic circuit
• Claude Shannon apply Boole’s work first time in
1938.”Analysis of relay and switching circuit”
 Boolean Operations & expression
• Boolean algebra is the mathematics of digital
system. the Digital gates perform Boolean
operation (AND, OR, NOT, NAND, NOR).
• Boolean expression represent the Boolean
operation performed by the logic Gates.
• F = A+ B
• F = A.B
• F = A’B + AB’
 Boolean Algebra
• Boolean Algebra is Convenient and systematic
way of expressing and analyzing the operations
of Logic circuits.

• Boolean Algebra expressions are written in terms

of variables, complement and literals using laws,
rules and theorems of Boolean Algebra.
 Boolean Algebra
• Variable: A variable is a symbol usually an
uppercase letter used to represent a logical
quantity (value = 0 or 1).
• Complement: A complement is the inverse of a
variable and is indicated by a bar over the
variable.
Complement of variable X is X’
If X = 0 then X = 1 and if X = 1 then X = 0.
• Literal: A Literal is a variable or the complement
of a variable.
 Boolean Algebra
• Boolean Addition.
– A + B, B + A, A + B + C
– A sum term is 1 when any one literal is a 1
– A sum term is 0 when all literals are a 0
• Boolean Multiplication.
– A.B , B.A , A.B.C
– A product term is 1 when all literal terms are a 1
– A product term is 0 when any one literal is a 0
Laws & Rules of Boolean Algebra
•Commutative Laws

•Associative Laws

•Distributive Law
 Commutative Law
• Commutative Law of Addition
A+B=B+A

• Commutative Law of Multiplication:

A*B=B*A
 Associative Law
• Associative Law of Addition:
A + (B + C) = (A + B) + C

• Associative Law of Multiplication:

A * (B * C) = (A * B) * C
 Distributive Law
• Distributive Law
A(B + C) = AB + AC
Boolean Rules
 Boolean Rule
• Rule 1: ( A + 0 =A)

• Rule 2: (A + 1= 1)
 Boolean Rule
• Rule 3: ( A.0 =A)

• Rule 4: (A.1= A)
 Boolean Rule
• Rule 5: ( A+A= A)

• Rule 6: (A + A’ = 1)
 Boolean Rule
• Rule 7: (A.A= A)

• Rule 8: (A. A’ = 0)
 Boolean Rule
• Rule 9: ((A’)’ = A)
 Boolean Rule
• Rule 10: (A +AB = A)
 Boolean Rules
• Rule 11: ( A + A’B = A +B )
 Boolean Rules
• Rule 12: (A + B)(A + C) = A + BC
De-Morgan Theorems
 De Morgan’s Theorems

• Theorem 1
XY  X  Y

• Theorem 2
X  Y  XY
Remember:
“Break the bar,
change the sign”
De Morgan’s Theorems
 Example
• Apply De-Morgan theorems.

• (A+B)+C

• (A + B ) + CD

• (A + B) C D + E + F
Boolean expression for logic circuit
• A combinational logic circuit can be described
by a Boolean equation . To drive the Boolean
expression for a given logic circuit , begin at
left most input and work toward final output,
write expression for each gate.
Simplification using Boolean Algebra
 Simplify
[AB’(C + BD )+ A’B’]C
 Task
• [AB(C+B’D’)+A’B’]CD
Q&A