UniKL BMI

SIMPLIFICATION

TOPIC 2: BOOLEAN ALGEBRA & LOGIC

BOOLEAN SIMPLIFICATION Using KARNAUGH MAP METHOD

Complete Simplification Process:
1. Identify the K-map from the Boolean expression OR truth table.
2. Place 1s in those squares corresponding to the product terms OR 1s in the output
column of truth table.
3. Do the looping (Process of combining these 1s)
a. Look for those 1s that are adjacent to each other.
b. The more 1s in a loop, the simpler will be the term expression.
c. Make sure to use the minimum number of loops.
d. Those 1s that are not adjacent to any other 1s is called isolated loop.
4. Form the product term from each loop.
a. When a variable appears in both complemented and uncomplemented
form within a loop, that variable is eliminated from the expression.
b. Variables that are the same for all squares of the loop will be appear in the
term.
Examples:
A. Simplified the following expression:
1.

Y ABC ABC

2.

Y A BCD A BC D A BC D A BC D

3.

Y A BC ABC ABC A BC

4.

Y ABC D A BC D ABC D A BC D

5.
Y ABC D ABC D ABCD ABC D A BC D ABC D ABC D ABCD ABC D

Digital Electronics BED12103

UniKL BMI
SIMPLIFICATION

TOPIC 2: BOOLEAN ALGEBRA & LOGIC

B. Simplified the following:

1.
A
0
0
0
0
1
1
1
1

B
0
0
1
1
0
0
1
1

C
0
1
0
1
0
1
0
1

Y
0
0
1
1
0
0
0
1

A
0
0
0
0
1
1
1
1

B
0
0
1
1
0
0
1
1

C
0
1
0
1
0
1
0
1

Y
0
0
0
1
0
1
1
1

A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

C
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

D
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

2.

3.
Z
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
1

Digital Electronics BED12103

UniKL BMI
SIMPLIFICATION

TOPIC 2: BOOLEAN ALGEBRA & LOGIC

4.
A
0
0
0
0
1
1
1
1

B
0
0
1
1
0
0
1
1

C
0
1
0
1
0
1
0
1

Y
0
0
0
X
X
1
1
1

5.
K
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

L
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

M
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

N
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

Y
0
1
1
X
1
X
X
X
0
0
0
X
0
X
X
X

Digital Electronics BED12103