MODULE 2

KARNAUGH MAP (K-MAP)

K- map is the graphical representation of the truth table.
KARNAUGH MAP (K-MAP)
STEPS IN K-MAPPING
Determine the number of
squares or cells of the K-
map.
• 2n= N ; where: n= no. of inputs

Construct the map and

place the output
N= no. of squares or states(0’s and 1’s) in
cells their respective cells.

*The minimum
Group adjacent cells into expression is composed
subcubes that will lead to of all variables that
a minimum expression. remain constant over the
subcube.
KARNAUGH MAP (K-MAP)

DEFINITION OF TERMS

SUBCUBES - a set of
exactly 2m adjacent
cells containing ones
or zeroes.

ADJACENT - identical
except in one variable
RULES IN FINDING THE MINIMUM
NO. OF SUBCUBES
Begin with cells that are adjacent to no other cell.

Find all cells that are adjacent to only one other cell.

Find those cells that lead to maximal subcubes of 4

cells. Find subcubes of 8 cells, etc.

The minimal expression is formed from a collection of

as few subcubes as possible, each of which is as
large as possible.
TWO-VARIABLE K-MAP
B
A 0 1
0 0 1

1 2 3

A
B 0 1
0 0 2

1 3
1
THREE-VARIABLE K-MAP
BC
A 00 01 11 10

0 0 1 3 2

1 4 5 7 6
THREE-VARIABLE K-MAP
AB
C 00 01 11 10

0 0 2 6 4

1 1 3 7 5
FOUR-VARIABLE K-MAP
CD
AB 00 01 11 10

00 0 1 3 2

01 4 5 7 6

11 12 13 15 14

10 8 9 11 10
FOUR-VARIABLE K-MAP
AB
CD 00 01 11 10

00 0 4 12 8

01 1 5 13 9

11 3 7 15 11

10 2 6 14 10
FOUR-VARIABLE K-MAP
CD C
AB
0 1 3 2

4 5 7 6
B
A 12 13 15 14

8 9 11 10

D
FOUR-VARIABLE K-MAP
CD C
AB
0 1 3 2

4 5 7 6
B
12 13 15 14
A
8 9 11 10

D
 FIVE-VARIABLE K-MAP
A=0 A=1
DE DE
00 01 11 10 00 01 11 10
BC BC
00 00
0 1 3 2 16 17 19 18
01 01
4 5 7 6 20 21 23 22

11 11 28 29 31 30
12 13 15 14
10 10
8 9 11 10 24 25 27 26
 SIX-VARIABLE K-MAP
u=0 u=1

yz yz
00 01 11 10 00 01 11 10
wx wx
00 00
0 1 3 2 32 33 35 34
01 01
v=0 4 5 7 6 36 37 39 38

11 12 13 15 14 11 44 45 47 46
10 10
8 9 11 10 40 41 43 42

yz yz
00 01 11 10 00 01 11 10
wx wx
00 00
16 17 19 18 48 49 51 50
01 01
v=1 20 21 23 22 52 53 55 54

11 11
28 29 31 30 60 61 63 62
10 10
24 25 27 26 56 57 59 58
 SIX-VARIABLE K-MAP
u=0 u=1
yz yz
y y
wx wx

0 1 3 2 32 33 35 34

v=0 4 5 7 6 36 37 39 38
x x

12 13 15 14 44 45 47 46
w w

8 9 11 10 40 41 43 42
z z
yz yz
y y
wx wx

16 17 19 18 48 49 51 50

v=1 20 21 23 22 x 52 53 55 54
x

w 28 29 31 30 w 60 61 63 62

24 25 27 26 56 57 59 58
z z
IN DETERMINING THE SIMPLIFIED BOOLEAN
FUNCTION IN SOP FORM, THE FOLLOWING
STEPS ARE DONE:
 IN DETERMINING THE SIMPLIFIED BOOLEAN FUNCTION
IN POS FORM, THE FOLLOWING STEPS ARE DONE:
 TWO-VARIABLE K-MAP
Ex. 1. Design a combinational network that will
accomplish the given truth table.

A B Z
0 0 1 Z = A’B’ + AB’ + AB
0 1 0
1 0 1
1 1 1
This is the equation derived using
SOP
 TWO-VARIABLE K-MAP
B
A 0 1

0 1 0

1 1 1
A
Z
Z = A+B’ B

A
B 0 1
0 1 1

1 0 1

Z = A+B’
 THREE-VARIABLE K-MAP
Ex. 2. Design a combinational network that will accomplish
the given below.
Z(A,B,C) = m(1,2,3,5,7)

A B C F
SOLUTION
Z(A,B,C) = m(1,2,3,5,7)
BC
A 00 01 11 10

0 0 1 1 1

1 0 1 1 0

Z = A’B + C A
B
Z
C
SOLUTION
Z(A,B,C) = m(1,2,3,5,7)
AB
C 00 01 11 10

0 0 1 0 0

1 1 1 1 1

Z = A’B + C A
B
Z
C
Ex. 2. Z(A,B,C,D) =m(0,4, 5,8,12,13,15)
Ex. 1. Z(A,B,C,D) =m(0,4, 5,8,12,13,15)

CD C
00 01 11 10
AB 0 1 3 2
00 1
4 5 7 6
01 1 1
12 13 15 14
B
11 1 1 1
A 8 9 11 10
10 1

Z = CD + BC’ + ABD
 Ex. 1. Z(A,B,C,D) =m(0,4,5,8,12,13,15)

AB
CD 00 01 11 10
0 4 12 8
00 1 1 1 1
1 5 13 9
1 1
01
3 7 15 11

11 1
2 6 14 10

10

Z = CD + BC’ + ABD
 FIVE-VARIABLE K-MAP
Ex. F(A,B,C,D,E) =m(0,2,4,6,9,13,21,23,25,29,31)

1 1

1 1 1 1 1

1 1

1 1

F = A’B’E’ + BD’E + ACE

SAMPLE PROBLEM
SAMPLE PROBLEM
SAMPLE PROBLEM
SAMPLE PROBLEM
SAMPLE PROBLEM
SAMPLE PROBLEM
SAMPLE PROBLEM
DON’T CARE CONDITION

Combination of variables whose

logical value is not specified

Can be used to provide further

simplification of the Boolean
expression in K-Map
 Sometimes a situation arises in which some
input variable combinations are not allowed. For
example, recall that in the BCD code, there are six

KARNAUGH invalid combinations. For NBCD: 1010, 1011,

1100, 1101, 1110 and 1111. Since these
unallowed states will never occur in an application
MAP WITH involving the BCD code, they can be treated as
"don't care" terms with respect to their effect on
"DON'T the output. That is, for these "don't care" terms
either a 1 or a 0 may be assigned to the output; it

CARE" really does not matter since they will never occur.

CONDITIONS For each "don't care" term, an X is placed in

the cell. The "don't care" terms can be used as an
advantage when simplifying because when
grouping the 1s (or 0's), the Xs can be treated as 1s
(or 0's) to maximize the number of elements in a
group. Note that maximizing the number of element
per group would result to simpler product term (or
sum term).
 DON’T CARES
- does not affect the system, could be 1 or 0
- 0’s and 1’s are the priorities

Ex. 1. ABC Z
000 d BC
A B
001 0 d d 1
A 1 1 1 d
010 1
C
011 d
100 1
101 1
BC
110 d A B
A d 0 d
111 1
d
C C
SAMPLE PROBLEM
SAMPLE PROBLEM
SAMPLE PROBLEM
SAMPLE PROBLEM
THANK YOU!