#3 Boolean Algebra and

Simplification Techniques
AU Jibia
 Introduction
 In ordinary algebra, the letter symbols can take on any number of values including
infinity. In Boolean algebra, they can take on either 0 and 1.
 The values assigned to a variable have a numerical significance in ordinary algebra,
whereas in its Boolean counterpart they have a logical significance.
 While ‘.’ and ‘+’ are respectively the signs of multiplication and addition in
ordinary algebra, in Boolean algebra ‘.’ means an AND operation and ‘+’ means an
OR operation.

2 Dept of Mechatronics Engineering, Bayero University Kano

 Laws of Boolean Algebra

3 Dept of Mechatronics Engineering, Bayero University Kano

 Simplification Techniques
 The primary objective of all simplification procedures is to obtain an
expression that has the minimum number of terms.
 Obtaining an expression with the minimum number of literals is usually the
secondary objective.
 If there is more than one possible solution with the same number of terms,
the one having the minimum number of literals is the choice.

4 Dept of Mechatronics Engineering, Bayero University Kano

 Canonical Form of Boolean Expressions
 An expanded form of Boolean expression, where each term contains all Boolean
variables in their true or complemented form, is also known as the canonical form
of the expression.
 After simplification, it usually loses its canonical form.
 Example

 After simplification it reduces to

5 Dept of Mechatronics Engineering, Bayero University Kano

 Simplification using Boolean theorems
 Example: Simplify the Boolean function 𝐹 = 𝐴𝐵 + 𝐵𝐶 + 𝐵′𝐶.

 Example: Simplify the Boolean function 𝐹 = 𝐴 + 𝐴′𝐵

6 Dept of Mechatronics Engineering, Bayero University Kano

 Simplification using Boolean theorems
 Example: Simplify the Boolean function 𝐹 = 𝐴′𝐵′𝐶 + 𝐴′𝐵𝐶 + 𝐴𝐵′.

 Example: Simplify the Boolean function F = AB + (AC)′ + AB′C(AB + C).

7 Dept of Mechatronics Engineering, Bayero University Kano

 Simplification using Boolean theorems
 Example: Simplify the Boolean function
′ ′ ′ ′
𝐹 = 𝑋𝑌 + 𝑋𝑌𝑍 + 𝑋 𝑌 + 𝑋𝑌 .

8 Dept of Mechatronics Engineering, Bayero University Kano

 Simplification using Boolean theorems
 Example: Simplify the Boolean function 𝐹 = 𝑋𝑌𝑍 + 𝑋𝑌′𝑍 + 𝑋𝑌𝑍′.

9 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 A Karnaugh map is a graphical representation of the logic system.
 It can be drawn directly from either minterm (sum-of-products) or maxterm
(product-of-sums) Boolean expressions.

10 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 Construction
 An n-variable Karnaugh map has 2n squares, and each possible input is allotted a
square.
 In the case of a minterm Karnaugh map, ‘1’ is placed in all those squares for which
the output is ‘1’. An ‘X’ is placed in squares corresponding to ‘don’t care’
conditions.
 In the case of a maxterm Karnaugh map, a ‘1’ is placed in all those squares for
which the output is ‘0’. An ‘X’ is placed in squares corresponding to ‘don’t care’
conditions.

11 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 Construction
 The designation of adjacent rows and adjacent columns should be the same except
for one of the literals being complemented. Extreme rows and extreme columns
are considered adjacent.

12 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 Guidelines for forming groups of 1s
 Each square containing a ‘1’ must be considered at least once.
 The objective should be to account for all the marked squares in the minimum
number of groups.
 The number of squares in a group must always be a power of 2.
 Each group should be as large as possible.
 ‘Don’t care’ entries can be used in accounting for all of 1-squares to make
optimum groups.

13 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method

Commonly used
styles for drawing
Karnaugh maps

14 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 Group formation in 4-variable Karnaugh map

15 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 Example: Find the simplified sum-of-products representation of the function from
the Karnaugh map shown

16 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 Example: A function, F, is defined such that it equals 1 when a 4-bit input code is
equivalent to any of the decimal numbers 3, 6, 9, 12 or 15. F is 0 for input codes 0,
2, 8 and 10. Other input values cannot occur. Use a Karnaugh map to determine a
minimal expression for this function. Design and sketch a circuit to implement this
function using only AND and NOT gates.

17 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 Example: A corporation having 100 shares entitles the owner of each share to cast
one vote at the share holders’ meeting. Assume that A has 60 shares, B has 30
shares, C has 20 shares, and D has 10 shares. A two-third majority is required to
pass a resolution in a share-holders’ meeting. Each of these four men has a switch
which he closes to vote YES and opens to vote NO for his percentage of shares.
When the resolution passed, one output LED is ON. Derive a truth table for the
output function and give the sum of product equation for it. Use a Karnaugh map
to determine a minimal expression for this function. Design and sketch a circuit to
implement this function using only NAND gates.

18 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 Example: Simplify the expression 𝐹 (𝑊, 𝑋, 𝑌, 𝑍) = ∏(0, 1, 4, 5, 6, 8, 9, 12, 13, 14).
 Solution: The above expression is given in respect to the maxterms. In the
Karnaugh map, 0s are to placed instead of 1s at the corresponding maxterm
squares.
Considering the 0s
𝐹′ = 𝑌′ + 𝑋𝑍′
𝐹 = (𝑌′ + 𝑋𝑍′)′ = 𝑌 (𝑋′ + 𝑍)

19 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 Example: Simplify the expression F (W,X,Y,Z) = (0, 1, 4, 5, 6, 8, 9, 12, 13, 14).
 Solution: The above expression is given in respect to the maxterms. In the
Karnaugh map, 0s are to placed instead of 1s at the corresponding maxterm
squares.
Considering the 1s
𝐹 = 𝑌𝑍 + 𝑋′𝑌
= 𝑌(𝑋′ + 𝑍).

20 Dept of Mechatronics Engineering, Bayero University Kano

 Karnaugh Map Method
 Exercise1: Design a combinational logic circuit which will accept a 4-bit binary number
and if the number is even, divide it by 210 and produce the binary result. If the number is
odd, multiply it by 210 and produce the binary result.
 Exercise2: The objective of this problem is to design a combinational logic circuit which
will aid in determination of the acceptability of emergency blood transfusions. It is known
that human blood can be categorized into four types—A, B, AB, and O. Persons with type
A blood can donate to both A and AB types, and can receive blood from both A and O
types. Persons with type B blood can donate to both B and AB, and can receive from both
B and O types. Persons with type AB blood can donate only to type AB, but can receive
from any type. Persons with type O blood can donate to any type, but can receive only
from type O. Make appropriate variable assignments and design a circuit which will
approve or disapprove any particular transfusion based on these conditions.

21 Dept of Mechatronics Engineering, Bayero University Kano