Activity 2.2.

1 Circuit Simpification:
Karnaugh Mapping
Introduction
At this point you have the ability to apply the theorems and laws of Boolean algebra to
simplify logic expressions in order to produce simpler and more cost effective digital logic
circuits. You may have also realized that simplifying a logic expression using Boolean
algebra, though not terribly complicated, is not always the most straightforward process.
There isn’t always a clear starting point for applying the various theorems and laws, nor is
there a definitive end in the process.

Wouldn’t it be nice to have a process for simplifying logic expressions that was more
straightforward, had a clearly defined beginning, middle, and end, and didn’t require you to
memorize all of the Boolean theorems and laws? Well there is, and it’s called Karnaugh
mapping. Karnaugh mapping, or K-Mapping, is a graphical technique for simplifying logic
expressions containing up to four variables.

In this activity you will learn how to utilize the Karnaugh mapping technique to simplify two,
three, and four variable logic expressions. Additionally, logic expressions containing don’t
care conditions will be simplified using the K-Mapping process.

Procedure
Write the simplified sum-of-products (SOP) logic expression for the K-Maps shown below

1. F1= A’ 2. F2=AC’ + C 3. F3= AC’ + A’C’D + A’CD’

B B C C CD CD CD CD
A 1 1 AB 0 1 AB 0 1 0 1

A 0 0 AB 0 0 AB 0 1 0 1

AB 1 1 AB 1 1 0 0

AB 1 0 AB 1 1 0 0

© 2014 Project Lead The Way, Inc.

Digital Electronics Activity 2.2.1 Circuit Simplification: Karnaugh Mapping – Page 1
After transferring the truth table data into the K-Maps, write the simplified sum-of-products
(SOP) logic expression for the K-Maps shown below.

4. F4 = Q

Q R F4
0 0 0 R R

0 1 0 Q 0 0
1 0 1
Q 1 1
1 1 1

5. F5 = QR’ + QS’ + RS’ Q’R’S

Q R S F5
0 0 0 0 S S

0 0 1 1 QR 0 1
0 1 0 1
0 1 1 0
QR 1 0
1 0 0 0 QR 1 0
1 0 1 1
1 1 0 1
QR 0 1
1 1 1 0

6. F6 = RT + QR’S’ + Q’RS + QR’ST’

Q R S T F6
0 0 0 0 0 ST ST ST ST
0 0 0 1 0 QR 0 0 0 0
0 0 1 0 0
0 0 1 1 0
QR 0 1 1 1
0 1 0 0 0 QR 0 1 1 0
0 1 0 1 1
0 1 1 0 1
QR 1 1 0 1
0 1 1 1 1
© 2014 Project Lead The Way, Inc.
Digital Electronics Activity 2.2.1 Circuit Simplification: Karnaugh Mapping – Page 2
 1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

After labeling the K-Map and transferring the truth table data into it, write the simplified
sum-of-products (SOP) logic expression for the K-Maps shown below.

7. F7 = W + W’X

W X F7
0 0 0 X’ X
0 1 1 W’ 0 1
1 0 1
W 1 1
1 1 1

8. F8 = Y’ + W’X’ + WX

W X Y F8
0 0 0 1 Y’ Y
0 0 1 1 W’X
’ 1 1
0 1 0 1
0 1 1 0 W’X 1 0
1 0 0 1 WX 1 1
1 0 1 0
1 1 0 1 WX’ 1 0
1 1 1 1

9. F9 = Y’Z + W’XYZ’ + WX’YZ’ +

W’X’Y’

W X Y Z F9
© 2014 Project Lead The Way, Inc.
Digital Electronics Activity 2.2.1 Circuit Simplification: Karnaugh Mapping – Page 3
 Y’Z’ Y’Z YZ YZ’
0
W’X’ 1 1 0 0
W’X 0 1 0 1
WX 0 1 0 0
WX’ 0 1 0 1

© 2014 Project Lead The Way, Inc.

Digital Electronics Activity 2.2.1 Circuit Simplification: Karnaugh Mapping – Page 4
Write the simplified sum-of-products (SOP) logic expression for the K-Maps shown below.
Be sure to take advantage of any don’t care conditions.

10. F10 = K’ + L’

L L

K X 1

K 1 0

11. F11 = L

M M

KL 0 0

KL 1 X

KL 1 1

KL X 0

12. F12 = M’N + K’L’N + K’LM’ + KMN’

MN MN MN MN
KL 0 1 1 0

KL 1 1 0 X

KL 0 X 0 X

KL 0 1 0 1

© 2014 Project Lead The Way, Inc.

Digital Electronics Activity 2.2.1 Circuit Simplification: Karnaugh Mapping – Page 5
Conclusion
1. Give three advantages of using K-mapping to simplify logic expressions over Boolean
algebra.
K-mapping is a faster way to simplify the different expressions
K-mapping provides a visual way to see the expression, which some people prefer
In K-mapping, no calculating is required due to the expression already being simplified

2. The three variable K-maps shown below can be completed with three groups of two.
The two groups shown (cells #1 & #3; cells #4 & #6) are required. The third group,
needed to cover the one in cell #2, could be cells #2 & #3 or cells #2 & #6.

Write the two possible logic expressions for the function F1.
A’C + AC’ + A’B
A’C + AC’ + BC’

3. These logic expressions are considered equal and equivalent but they do not look the
same. Explain why these two expressions can be considered equal and equivalent
even though they are not identical.
Because when they are used, they will both lead to the same results, but just the
combination of the last gate is different.

© 2014 Project Lead The Way, Inc.

Digital Electronics Activity 2.2.1 Circuit Simplification: Karnaugh Mapping – Page 6
Going Further – Optional
1. The following four variable K-Maps can be solved using the traditional method of
grouping the ones (Identify the 3 groups of 8).

F1 = ?
CD CD CD CD
The three groups of 8 are:
 The bottom 2 rows of AB 1 1 1 1
ones
 The bottom row of ones AB 1 0 0 1
and the top row of ones
 The left column of ones AB 1 1 1 1
and the right column of
ones
AB 1 1 1 1

2. Rather than taking this approach, let’s get creative and take advantage of the fact that
the K-Map contains only two zeros. Group these zeros and write the logic expression.

(A’BD)’

Since you grouped the zeroes, this is the logic expression for
F1 .

3. Now apply DeMorgan’s Theorem to get the logic expression for

F1 .

A + B’ + D’

4. What is the advantage of taking this approach over the traditional approach of circling
the ones?
It is a little bit more simpler when you use DeMorgan’s Theorem because you just
break the line and change the sign.

5. Are there any disadvantages?

No
© 2014 Project Lead The Way, Inc.
Digital Electronics Activity 2.2.1 Circuit Simplification: Karnaugh Mapping – Page 7