Boolean Algebra:

“An Algebra of Logic”

Lecturer: Antonius Suhartomo, B.Sc., M.Eng.Sc., M.B.A., Ph.D.

*By Praveen M Jiga Jinni

 Introduction

 Developed by English Mathematician George Boole in between 1815 –

1864
 It is described as an algebra of logic or an algebra of two values i.e.,
True or False
 The term logic means a statement having binary decisions i.e., True/Yes
or False/No.
Application of Boolean Algebra

 It is used to perform the logical operations in digital computer.

 In digital computer True represent by ‘1’ (high volt) and False
represent by ‘0’ (low volt).
 Logical operations are performed by logical operators. The
fundamental logical operators are:
1. AND (conjunction)
2. OR (disjunction)
3. NOT (negative/complement)
AND operator

It performs logical multiplication and denoted by dot.

0 0 0
0 1 0
1 0 0
1 1 1
OR operator

It performs logical addition and denoted by plus.

0 0 0
0 1 1
1 0 1
1 1 1
NOT operator

 It performs logical negation and denoted by bar. It

operates on single variable.
(means complement of )
0 1
1 0
Truth Table

 Truth table is a table that contains all possible values of

logical variables/statements in a Boolean expression.
Number of possible combination , where number of
variables used in a Boolean expression.
Truth Table

 The truth table for is as follows:

0 0 0 0 0 0
1 0 0 1 0 1
2 0 1 0 0 0
3 0 1 1 0 1
4 1 0 0 0 0
5 1 0 1 0 1
6 1 1 0 1 1
7 1 1 1 1 1
Tautology & Fallacy

 If the output of Boolean expression is always True or 1 called

Tautology.
 If the output of Boolean expression is always False or 0 is called
Fallacy
Output Output
0 1 1 0
1 0 1 0

PVP’ is Tautology and PVP’ is Fallacy

Exercise

 Evaluate the following Boolean expression using Truth

Table.
(a) (b) (c)
 Verify that is a Tautology
 Verify that
Implementation

 Boolean Algebra applied in computers electronic

circuits.
 These circuits perform Boolean operations and these
are called logic circuits of logic gates.
Logic Gate

 A gate is an digital circuit which operates on one or more signals

and produce single output.
 Gates are digital circuits because the input and output signals are
denoted by either (high voltage) or (low voltage).
 Three type of gates are as under:
1. AND gate
2. OR gate
3. NOT gate
AND gate

 The AND gate is an electronic circuit that gives a high output only
if all its inputs are high.
 AND gate takes two or more input signals and produce only one
output signal.

0 0 0
0 1 0
1 0 0
1 1 1
OR gate

 The OR gate is an electronic circuit that gives a high output only if one or
more its inputs are high.
 OR gate also takes two or more input signals and produce only one output
signal.

0 0 0
0 1 1
1 0 1
1 1 1
NOT gate

 The NOT gate is an electronic circuit that gives a high output if its
input is low.
 NOT gate takes only one input signal and produce only one
output signal.
 The output of NOT gate is complement of its input.
 It is also called inverter.

0 1
1 0
Principle of Duality

 In Boolean algebras the duality Principle can be is

obtained by interchanging AND and OR operators and
replacing 0’s by 1’s and 1’s by 0’s.
 Compare the identities on the left side with the
identities on the right.
Example
Basic Theorem of Boolean Algebra

 T1: Properties of 0

 Properties of 1
Basic Theorem of Boolean Algebra

 Commutative Law  Distribution Law

a) A

 Associate Law
Basic Theorem of Boolean Algebra

 T5: Indempotence (Identity) Law

 T6: Absorption (Redundance) Law

Basic Theorem of Boolean Algebra

 T8: Complementary Law

 T9: Involution

 T10: De Morgan’s Theorem

Exercise

 Q1. State % Verify De Morgan’s Law by using truth table and

algebraically.
 Q2. State and verify distributive law.
 Q3. Draw a logic diagram for the following expression:
Representation of Boolean
Expression
 Boolean expression can be represented by either
i. Sum of Product (SOP) form or
ii. Product of Sum (POS) form
e.g.

In above examples both are in SOP and POS respectively but they are
not in Standard SOP and POS
Canonical Form of Boolean
Expression (Standard Form)
 In standard SOP and POS each of Boolean expression
must contain all the literals (with and without bar) that
has been used in Boolean expression.
 If the above condition is satisfied by the Boolean
expression, that expression is called Canonical form of
Boolean expression.
Canonical Form of Boolean Expression
(Standard Form) contd..

 In Boolean expression the literal is missing in the 1st term and is

missing in 2nd term .
 That is why is not a Canonical SOP
 Convert in Canonical SOP (Standard SOP)
 Solution:
 Canonical Form of Boolean Expression
(Standard Form) contd..

 Convert in Canonical SOP (Standard SOP)

 Solution:
Canonical Form of Boolean Expression
(Standard Form) contd..

 Minterm and Maxterm

 Individual term of Canonical Sum of Product (SOP) is called
Minterm. In other words minterm is a product of all the literals
(with or without bar) within the Boolean expression.
 Individual term of Canonical Products of Sum (POS) is called
Maxterm. In otherwords maxterm is a sum of all the literals (with
or without bar) within the Boolean expression.
Minterms & Maxterms for 2 variables
(Derivation of Boolean function from Truth
Table)

0 0 0
0 1 1
1 0 2
1 1 3

 The minterm , should evaluate to 1 for each combination of and .

 The maxterm is the complement of the minterm
Minterms & Maxterms for 3
variables
0 0 0 0
0 0 1 1
0 1 0 2
0 1 1 3
1 0 0 4
1 0 1 5
1 1 0 6
1 1 1 7

Maxterm is the complement of minterm

Solved Problem

 Find the minterm designation of

 Solution: Substitute for non barred and for barred letters.
 Binary equivalent
 Decimal equivalent
 Thus,
Purpose of the Index

 Minterms and Maxterms are designated with an index

 The index number corresponds to a binary pattern
 The index for the minterm or maxterm, expressed as a binary number, is used to
determine whether the variable is shown in the true or complemented form
 For Minterms:
 ‘1’ means the variable is “Not Complemented” and
 ‘0’ means the variable is “Complemented”.

 For Maxterms:
 ‘0’ means the variable is “Not Complemented” and
 “1” means the variable is “Complemented”
 Solved Problem
Write SOP form of a Boolean Function , which is represented
by the following truth table.

 Sum of minterms of entries that evaluate to “1”. So, focus on “1”

0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

𝐹=𝑚1 +𝑚6 +𝑚7 =∑ ( 1,6,7 ) =𝑥𝑦 𝑧+𝑥𝑦 𝑧+𝑥𝑦𝑧

Exercise

 Write POS form of a Boolean Function , which is represented by the following

truth table

0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
Exercise

 Write equivalent canonical form of Product expression for the following

Product of Sum Expression:
Truth table to K-Map (2 variable
minterm)
 Truth table to K-Map (2 variable minterm)
 The expression is:
 Minterms are represented by a 1 in the corresponding location in the K map.
K-Map (2 variable cont’d)

 Adjacent 1’s can be “paired off”

 Any variable which is both a 1 and a zero in this pairing can be eliminated
 Pairs may be adjacent horizontally or vertically

 After reduction the expression becomes

Three Variable K-Map

One square filled in for each minterm

 Notice the code sequence:

 00 01 11 10 – a Gray code
Three Variable K-Map (Cont’d)
Three Variable K-Map (Cont’d)
Karnaugh Maps – Four Variable K-
Map
Karnaugh Maps – Four Variable K-
Map (Octet reduction)
Karnaugh Maps – Four Variable K-
Map (Octet reduction)
Karnaugh Maps – Four Variable K-
Map (Quad reduction)
Karnaugh Maps – Four Variable K-
Map (Quad reduction)
Karnaugh Maps – Four Variable K-
Map (Quad reduction)