Karnaugh maps

Method
 Contents
• Introduction
• Two variable maps
• Three variable maps
• Four variable maps
• Five variable maps
• Six variable maps
 Introduction
• The map method provides a simple straight forward
procedure for minimizing Boolean functions.

• This method may be regarded either as a pictorial form of a

truth table or as an extension of the Venn diagram.

• The map method, first proposed by Veitch (1) and slightly

modify by Karnaugh (2), is also known as the ‘Veitch
diagram’ or the ‘Karnaugh map’.
 Introduction
• A K-map is a matrix consisting of rows and columns that represent
the output values of a Boolean function.

• The K-Map consists 2n cells with ‘n’ input variables .

• The output values placed in each cell are derived from the
minterms/Maxterms of a Boolean function.

• A minterm/Maxterm is a product term/Sum term that contains all of

the function’s variables exactly once, either complemented or not
complemented.
Cont.

Minterm

• Standard Product Term

• For n – variable function → 2n
minterm
• Sum of all minterms = 1 i.e. ∑mi = 1
Cont.

Maxterm

• Standard Sum Term

• For n – variable function → 2n maxterm
• Product of all maxterms = 1 i.e. ∏Mj =
1
Cont.

• SOP Form:
– AND - OR Logic or NAND - NAND
Logic
Cont.

• POS Form:
– OR - AND Logic or NOR - NOR
Logic
 Two variable K-map
• There are four minterms for two variables;
hence the map consists of four squares,
one for each minterm.
• The 0’s and 1’s marked for each row and each
column designate the values of variables x
and y, respectively.
mo m1

m2 m3
Cont.

mo m1

m2 m3
Cont.

x
mo m1
y
m2 m3

• Take two variables x and

y
 Cont.
y’ y
y
x 0 1
X’ 0 mo m1

X 1 m2 m3

• Relation between squares & two

variables
 Cont.
y’ y
y
x 0 1
X’ 0 x’y’

X 1

• Relation between squares & two

variables
 Cont.
y’ y
y
x 0 1
X’ 0 x’y’ x’y

X 1

• Relation between squares & two

variables
 Cont.
y’ y
y
x 0 1
X’ 0 x’y’ x’y

X 1 xy’

• Relation between squares & two

variables
 Cont.
y’ y
y
x 0 1
X’ 0 x’y’ x’y

X 1 xy’ xy

• Relation between squares & two

variables
 Three variable K-map
• There eight minterms for three binary
variables. Therefore, a map consists of
eight squares.

m0 m1 m3 m2

m4 m5 m7 m6
Cont.

m0 m1 m3 m2

m4 m5 m7 m6
 Cont
.
yz
x m0 m1 m3 m2

m4 m5 m7 m6

• Take three variables x, y and

z
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ m0 m1 m3 m2
0
x 1 m4 m5 m7 m6

• Relation between squares & three

variables
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ x’y’z’
0
x 1

• Relation between squares & three

variables
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ x’y’z’ x’y’z
0
x 1

• Relation between squares & three

variables
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ x’y’z’ x’y’z x’yz
0
x 1

• Relation between squares & three

variables
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ x’y’z’ x’y’z x’yz x’yz’
0
x 1

• Relation between squares & three

variables
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ x’y’z’ x’y’z x’yz x’yz’
0
x 1 xy’z’

• Relation between squares & three

variables
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ x’y’z’ x’y’z x’yz x’yz’
0
x 1 xy’z’ xy’z

• Relation between squares & three

variables
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ x’y’z’ x’y’z x’yz x’yz’
0
x 1 xy’z’ xy’z xyz

• Relation between squares & three

variables
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ x’y’z’ x’y’z x’yz x’yz’
0
x 1 xy’z’ xy’z xyz xyz’

• Relation between squares & three

variables
 Four Variable K-map
• There sixteen minterms for four binary
variables. Therefore, a map consists of sixteen
squares.
m0 m1 m3 m2

m4 m5 m7 m6

m12 m13 m15 m14

m8 m9
m11 m10
Cont.

CDC’D’ C’D CD C
A 00 01
D’ 11 10
B
A’B’ m0 m1 m3 m2
00
m4 m5 m7 m6
A’B
A 1 m12 m13 m15 m14
01
B 1
m8 m9
A B’ 10 m11 m10

• Take four variables A,B,C and

Cont.

C C’D C’ CD C
A ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D’

A’B 01
A B 11
A B’ 10

• Relation between squares & four

Cont.

C C’D C’ CD C
A ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D’ A’B’C’D

A’B 01
A B 11
A B’ 10

• Relation between squares & four

Cont.

A C C’D C’ CD C
’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D’ A’B’C’D A’B’CD

A’B 01
A B 11
A B’ 10

• Relation between squares & four

Cont.
C’D C’ CD C
A C ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D’ A’B’C’D A’B’CD A’B’CD’

A’B 01
A B 11
A B’ 10

• Relation between squares & four

Cont.

C C’D C’ CD C
A ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’

A B 11
A B’ 10

• Relation between squares & four

Cont.

C C’D C’ CD C
A ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D

A B 11
A B’ 10

• Relation between squares & four

Cont.
C’D C’ CD C
A C ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D A’BCD

A B 11
A B’ 10

• Relation between squares & four

Cont.

A C C’D C’ CD C
’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D A’BCD A’BCD’

A B 11
A B’ 10

• Relation between squares & four

Cont.

A C C’D C’ CD C
’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D A’BCD A’BCD’

A B 11 ABC’D’

A B’ 10

• Relation between squares & four

Cont.
C’D C’ CD C
A C ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D A’BCD A’BCD’

A B 11 ABC’D’ ABC’D

A B’ 10

• Relation between squares & four

Cont.

C C’D C’ CD C
A ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D A’BCD A’BCD’

A B 11 ABC’D’ ABC’D ABCD

A B’ 10

• Relation between squares & four

Cont.

C C’D C’ CD C
A ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D A’BCD A’BCD’

A B 11 ABC’D’ ABC’D ABCD ABCD’

A B’ 10

• Relation between squares & four

Cont.

A C C’D C’ CD C
’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D A’BCD A’BCD’

A B 11 ABC’D’ ABC’D ABCD ABCD’

A B’ 10 AB’C’D’

• Relation between squares & four

Cont.
C’D C’ CD C
A C ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D A’BCD A’BCD’

A B 11 ABC’D’ ABC’D ABCD ABCD’

A B’ 10 AB’C’D’ AB’C’D

• Relation between squares & four

Cont.

C C’D C’ CD C
A ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D A’BCD A’BCD’

A B 11 ABC’D’ ABC’D ABCD ABCD’

A B’ 10 AB’C’D’ AB’C’D AB’CD

• Relation between squares & four

Cont.

C C’D C’ CD C
A ’00 01
D 11
D’ 10
B D
A’B’ 00 A’B’C’D A’B’C’D A’B’CD A’B’CD’
’

A’B 01 A’BC’D’ A’BC’D A’BCD A’BCD’

A B 11 ABC’D’ ABC’D ABCD ABCD’

A B’ 10 AB’C’D’ AB’C’D AB’CD AB’CD’

• Relation between squares & four

 Five variable K-map
• There thirty two minterms for five binary
variables. Therefore, a map consists of
thirty two squares.

m0 m1 m3 m2
m16 m17 m19 m18

m4 m5 m7 m6
m20 m21 m23 m22

m12 m13 m15 m14 m28 m29 m31 m30

m8 m9
m11 m10 m24 m25 m27 m26
 Cont.
DE A’ A
BC 000 001 011 010 100 101
111
m m1 110 m
m
0 3 2
m16 m17 m19 m18
00 m4 m5 m7 m6
m20 m21 m23 m22
01
m12 m13 m15 m14 m28 m29 m31 m30
11 m8 m9
m11 m10 m24 m25 m27 m26
10
Cont.

• Hence the simplified expression becomes

BC’D’E + A’BC’D + AC’DE’ + AB’C’D + A’B’CE +

A’CDE’
+ A’BCD + AB’CD’+ ABD’E’ +
AB’DE’ + A’B’DE + ABCDE
 6 variable K-map
• A 6-variable K-Map will have 26 = 64 cells. A function F
which has maximum decimal value of 63, can be defined
and simplified by a 6- variable Karnaugh Map.
Cont.
Cont.

• Boolean table for 6 variables is quite big, so we have

shown only values, where there is a noticeable change
in values which will help us to draw the K-Map.

• A = 0 , B = 0 for decimal values 0 to 15 and A = 0, B = 1

for decimal values 16 to 31.

• A = 1 , B = 0 for decimal values 32 to 47 and A = 1 , B = 1

for decimal values 48 to 63.
Cont.

No. A B C D E F Minterm
m0 0 0 0 0 0 0 A’B’C’D’E’F’
0 0 1 1 1 1 A’B’CDEF
m15

0 1 0 0 0 0 A’BC’D’E’F’
m16

0 1 1 1 1 1 A’BCDEF
m31

1 0 0 0 0 0 AB’C’D’E’F’
m32

1 0 1 1 1 1 AB’CDEF
m47

1 1 0 0 0 0 ABC’D’E’F’
m48
 K-map from Truth Tables
AND Gate Truth Table OR Gate Truth Table Ex-OR Gate Truth Table
A B Y A B Y A B Y

0 0 0 0 0 0 0 0 0

0 1 0 0 1 1 0 1 1

1 0 0 1 0 1 1 0 1

1 1 1 1 1 1 1 1 0

B’ B B’ B B’ B
B B B
A 0 1 A 0 1 A 0 1

A’ 0 A’ 0 0 1 A’ 0 0 1
0 0 0 1 0 1
0 1

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

Y = AB Y= A+B Y = A’B + AB’

 K-map from Truth Tables
3-Var -Truth Table
A B C Y

0 0 0 0
BC B’C’ B’C BC BC’
0 0 1 1 A 00 01 11 10
0 1 0 0
A’ 0 0 1 1 0
0 1 1 1
0 1 3 2
1 0 0 0

1 0 1 1 A 1 0 1 1 0
4 5 7 6
1 1 0 0

1 1 1 1
 K-map minimization-Rules
1. No 0’s allowed in the groups.
2. No diagonal grouping allowed.
3. Only power of 2 number of cells in each group
(20, 21, 22, 23, 24, 25, …)
4. Groups should be as large as possible.
5. Every 1 must be in at least one group.
6. Overlapping allowed.
7. Wrap around allowed.
8. Fewest number of groups are considered.
9. Redundant groups ignored
Form groups of adjacent 1's. Make groups as large as
possible.

Group size must be a power of two. i.e. Group of

• 8 Adjacent 1's is called as OCTET,
• 4 Adjacent 1's is called as QUAD,
• 2 Adjacent 1's is called as PAIR or
• 1 One 1 which is not is grouped with another 1 is
called as
Isolated One
 RS R’S’ R’S RS RS’
PQ 00 01 11 10
P’Q’ 00 0 0
1 1
1 3
0 2

P’Q 01 1 4
1 5
1 7 0 6

P 11 1 0 1 1
12 13 15 14
Q
PQ’ 10 0 0 1 1
8 9 11 10
 Quad
(m1, m3, m5, m7)

RS R’S’ R’S RS RS’

PQ 00 01 11 10
P’Q’ 00 0 0
1 1
1 3
0 2

Redundant Group
P’Q 01 1 4
1 5
1 7 0 6

P 11 1 0 1 1
12 13 15 14
Q
PQ’ 10 0 0 1 1
8 9 11 10

Redundant Group
Pair
(m4, m12) Quad
(m10, m11, m14, m14)
 Octet
RS R’S’ R’S RS RS’ RS R’S’ R’S RS RS’
PQ 00 01 11 10 PQ 00 01 11 10
P’Q’
00 1 0 1 1 3 2 P’Q’
00
0 1 1 13 2

P’Q
01 1 15 15 17
4 7 6
P’Q
01 4 6

PQ
11 1 1 PQ
11 1 1
12 13 15 14 12 13 15 14

PQ’
10 18 19
PQ’
10 19 111
11 10 8 10

RS R’S’ R’S RS RS’

PQ 00 01 11 10
P’Q’
00
0 1 1 3 1 2

P’Q
01 4 5
1 7
1 6

PQ
11 1 1
12 13 15 14

PQ’
10 1 1 10
8 9 11
 Octet
RS R’S’ R’S RS RS’ RS R’S’ R’S RS RS’
PQ 00 01 11 10 PQ 00 01 11 10
P’Q’
00 1 0 1 1 1 3 1 2 P’Q’
00
0 1 3 2

P’Q
01 1 15 1 1 1 1 17 1
4 7 6
P’Q
01 4 5 6

PQ
11 PQ
11 1 12 1 1 1 14
12 13 15 14 13 15

PQ’
10 PQ’
10
8 9 11 10 8 9 11 10

RS R’S’ R’S RS RS’

PQ 00 01 11 10
00
P’Q’ 0 1 3 2

P’Q
01 4 5 7 6

PQ
11 1 1 1 1
12 13 15 14

PQ’
10 18 1 1 1 10
9 11
 Octet
RS R’S’ R’S RS RS’
PQ 00 01 11 10
P’Q’
00 1 0 1 3 1 2

P’Q
01 1 4 5 7
1 6

PQ
11 1 1
12 13 15 14

PQ’
10 18 1 10
9 11

RS R’S’ R’S RS RS’

PQ 00 01 11 10
1 1 1 1 3 12
00
P’Q’ 0

P’Q
01 4 5 7 6

PQ
11
12 13 15 14

PQ’
10 18 1 1 1 10
9 11
 Quad
RS R’S’ R’S RS RS’ RS R’S’ R’S RS RS’
PQ 00 01 11 10 PQ 00 01 11 10
P’Q’
00 1 0 1 3 2 P’Q’
00
0 1 1 3 2

P’Q
01 1 4 5 7 6
P’Q
01 4
15 7 6

PQ
11 1 PQ
11 1
12 13 15 14 12 13 15 14

PQ’
10 18
PQ’
10 19
9 11 10 8 11 10

RS R’S’ R’S RS RS’ RS R’S’ R’S RS RS’

PQ 00 01 11 10 PQ 00 01 11 10
1 P’Q’
00
0 1 3 1 2
00
P’Q’ 0 1 3 2

1 P’Q
01 1
P’Q
01 4 5 7 6 4 5 7 6

PQ
11 1
PQ
11 1
12 13 15 14
12 13 15 14

PQ’
10
PQ’
10 1 10
8 9
1 11 10
8 9 11
 Quad
RS R’S’ R’S RS RS’ RS R’S’ R’S RS RS’
PQ 00 01 11 10 PQ 00 01 11 10
P’Q’
00 1 0 1 1 1 3 1 2 P’Q’
00
0 1 3 2

P’Q
01 4 5 7 6
P’Q
01 1 4
1 5
17 1 6

PQ
11 PQ
11
12 13 15 14 12 13 15 14

PQ’
10 PQ’
10
8 9 11 10 8 9 11 10

RS R’S’ R’S RS RS’ RS R’S’ R’S RS RS’

PQ 00 01 11 10 PQ 00 01 11 10
00
P’Q’ 0 1 3 2
00
P’Q’ 0 1 3 2

P’Q
01 4 5 7 6
P’Q
01 4 5 7 6

PQ
11 1 1 1 1 PQ
11
12 13 15 14 12 13 15 14

PQ’
10 PQ’
10 18 1 1 1 10
8 9 11 10 9 11
 Quad
RS R’S’ R’S RS RS’ RS R’S’ R’S RS RS’
PQ 00 01 11 10 PQ 00 01 11 10
P’Q’
00 1 0 1 1 3 2 P’Q’
00
0 1 1 13 2

P’Q
01 1 15 15 17
4 7 6
P’Q
01 4 6

PQ
11 PQ
11
12 13 15 14 12 13 15 14

PQ’
10 PQ’
10
8 9 11 10 8 9 11 10

RS R’S’ R’S RS RS’

PQ 00 01 11 10
P’Q’
00
0 1 1 3 1 2

P’Q
01 4 5
1 7
1 6

PQ
11
12 13 15 14

PQ’
10
8 9 11 10
 Quad
RS R’S’ R’S RS RS’ RS R’S’ R’S RS RS’
PQ 00 01 11 10 PQ 00 01 11 10
P’Q’
00 0 1 3 2 P’Q’
00
0 1 3 2

P’Q
01 4 5 7 6
P’Q
01 4 5 7 6

PQ
11 PQ
11 113 115
1 12 113 15 14 12 14

PQ’
10 19
PQ’
10 19 111
18 11 10 8 10

RS R’S’ R’S RS RS’

PQ 00 01 11 10
00
P’Q’ 0 1 3 2

P’Q
01 4 5 7 6

PQ
11 1 1 14
12 13 15

PQ’
10 1 1 10
8 9 11
 Quad
RS R’S’ R’S RS RS’
PQ 00 01 11 10
00
P’Q’ 0 1 3 2

P’Q
01 4
15 17 6

PQ
11 1 1
12 13 15 14

PQ’
10
8 9 11 10

RS R’S’ R’S RS RS’

PQ 00 01 11 10
1 1 2
P’Q’
00 0 1 3

P’Q
01 4 5 7 6

PQ
11
12 13 15 14

PQ’
10 1 10
1 8 9 11
 Pair
RS R’S’ R’S RS RS’
PQ 00 01 11 10
P’Q’
00 0 1 1 3 2

P’Q
01 4
15 1 7
1 6

PQ
11 1 1 1
12 13 15 14

PQ’
10
8 9 1 11 10

BC B’C’ B’C BC BC’

A 00 01 11 10

A’ 0 0 1 1 0 A’C
0 1 3 2

A 1 0 0 1 1
4 5 7 6
AB
 Pair
y’z y z y z’
yz y’z’
x 0001 11 10

x’ 0 0 1 0
0
x 1 1 0 1 1
Example – Representation (Notation)

K-map of F(a,b,c) = m(1,3,5)

=M(0,2,4,6,7)
Example – Representation (Notation)
K-map of
f(A,B,C) = m(0,3,5) = M(1,2,4,6,7)

BC B’C’ B’C BC BC’

A 00 01 11 10

A’ 0 1 0 1 0
0 1 3 2

A 1 0 1 0 0
4 5 7 6
Example – Representation (Notation)
K-map of
f(A,B,C) = m(0,3,5)

BC B’C’ B’C BC BC’

A 00 01 11 10

A’ 0 1 1
0 1 3 2

A 1 1
4 5 7 6
Example – Representation (Notation)
K-map of
f(A,B,C) = M(1,2,4,6,7)

BC B+C B+C’ B’+C’ B’+C

A 00 01 11 10

A 0 0 0
0 1 3 2

A 1 0 0 0
’ 4 5 7 6
Example – Representation (Notation)
K-map of
f(P,Q,R,S) = m(0,3,5,7,10,11,12,13,14,15) = M(1,2,4,6,8,9)

RS R’S’ R’S RS RS’

PQ 00 01 11 10
P’Q’ 00 1 0
0 1
1 3
0 2

P’Q 01 0 4
1 5
1 7 0 6

P 11 1 1 1 1
12 13 15 14
Q
PQ’ 10 0 0 1 1
8 9 11 10
Example – Representation (Notation)
K-map of
f(P,Q,R,S) = m(0,3,5,7,10,11,12,13,14,15)

RS R’S’ R’S RS RS’

PQ 00 01 11 10
P’Q’ 00 1 0 1
1 3 2

P’Q 01 4
1 5
1 7 6

P 11 1 1 1 1
12 13 15 14
Q
PQ’ 10 1 1
8 9 11 10
Example – Representation (Notation)
K-map of
f(P,Q,R,S) = M(1,2,4,6,8,9)

RS R+S R+S’ R’+S’ R’+S

PQ 00 01 11 10
P+Q 00 0
0 1 3
0 2

P+Q’ 01 0 4 5 7 0 6

P’+Q’ 11
12 13 15 14

P’+Q 10 0 8 0 9 11 10
 Example (2-Variable)
• Obtain the following simplified Boolean
functions using k-map:
– F = x’y + xy’ + xy
 Cont.
y’ y
y
x 0 1
X’ 0
x’y’ x’y
(m0) (m1)

1
xy’ Xy
X (m2) (m3)

• Relation between squares & two

variables
 Cont.
y’ y
y
x 0 1
X’ 0 0 1

X 1 1 1

• F = x’y + xy’ + xy = m1 + m2 + m3
 Cont.
y’ y
y
x 0 1
X’ 0 0 1

X 1 1 1

• F =x+y
 Example (3-Variable)
• Simplify the Boolean function:
– F = x’yz + xy’z’ + xyz + xyz’

• Ans.:
– x’yz = m3
– xy’z’ = m4
– xyz = m7
– xyz =
’ m6
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ m0 m1 m3 m2
0
x 1 m4 m5 m7 m6

• F = x’yz + xy’z’ + xyz +

xyz’
 Cont
y’z’ . yz
y’z y z’
y 00 01 11 10
xz
x’ 0 0 1 0
0
x 1 1 0 1 1

• F = x’yz + x’yz’ + xy’z’ +

xy’z
 Cont
.
yz y’z’ y’z y z y z’
x 0001 11 10

x’ 0 0 1 0
0
x 1 1 0 1 1

• Final Ans.
F = yz +
 Cont
.
• Simplify the Boolean function:
f(x,y,z) = ∑m(0,1,2,3,4,6)

• Final Ans.
F = x’+ z’
 Example

K-map of F(a,b,c) = m(1,3,5)

=M(0,2,4,6,7)
 Example
Simplify the function F(a,b,c) = m(1,3,5) b’c
using K-Map technique

a’c

Simplified function in SOP is F(a,b,c) = a’c + b’c

 Example
Simplify the function F(a,b,c) = a’ + b’
=M(0,2,4,6,7) using K-Map
technique

Simplified function in POS is F(a,b,c) = c . (a’+ b’)

 Problems using K-Map - SOP

Q. Z= ∑A,B,C(1,3,6,7) minimize the given function using

K-Map method
BC B’C’ B’C BC BC’
A 00 01 11 10

A’ 0 0 1 1 0 A’C
0 1 3 2

A 1 0 0 1 1
4 5 7 6
AB

Final expression Z = A’C+AB

 Example (4-Variable)

Q. Minimize the following function using K-Map method

F(A,B,C,D)=∑(0,2,5,8,9,10,11,12,13,14,15)
CD C’D’ C’D CD CD’
AB 00 01 11 10 BC’D

A’B’ 00 1 0
0 1
0 3
1 2
A
A’B 01 0 4
1 5
0 7 0 6

A 11 1 1 1 1
12 13 15 14
B
AB’ 10 1 1 1 1
8 9 11 10
B’D’
Answer F = A + B’D’ + BC’D
 Problems using K-Map - SOP

Q. Minimize the following function using K-Map method

F(A,B,C,D)=∑(0,2,5,7,8,10,13,15)
CD C’D’ C’D CD CD’
AB 00 01 11 10
A’B’ 00 1 0
0 1
0 3
1 2
BD
A’B 01 0 4
1 5
1 7
0
6

A 11 0 1 1 0
12 13 15 14
B
AB’ 10 1 0 0 1
8 9 11 10
B’D’
Answer F = BD + B’D’
 Example
• Simplify the Boolean
function:
– F(w, x, y, z) = Σ(1,5,12,13)
 Cont.
F(w, x, y, z) = Y
Σ(1,5,12,13)
W Z 00 01 11
10
X 0 m0 m1 m3 m2

0 m4 m5 m7 m6

0
m12 m13 m15 m14
1
1 m8 m9
m11 m10
1
0
1
 Cont.
F(w, x, y, z) =
Put 1 in place
Σ(1,5,12,13)
Y
m1, m5, m12,
of W Z 00 01 11
10
m13 X 0 0 1 0 0

0 0 1 0 0

0 1 1 0 0
1
1 0 0 0 0
1
0
1
 Cont.
F(w, x, y, z) = Y
Σ(1,5,12,13)
Put 1 in place W Z 00 01 11 10
of
X 0 0 1 0 0

m1, m5, m12, 0 0 1 0 0

0
m13
1 1 1 0 0
Making pairs 1
1
1
0 0 0 0
0
 Cont.
F(w, x, y, z) = Y
Σ(1,5,12,13)
Put 1 in place W Z 00 01 11 10
of
m1, m5, m12,
X 0 0 1 0 0

m13 0 0 1 0 0
0
1 1 1 0 0
Making pairs 1
Hence the
simplified
1
1 0 0 0 0
Expression is 0
F = WXY’ + W’Y’Z
 Example (4-Variable)
• Simplify the Boolean function
Example
 Example
Write the simplified expressions for following function
F (W,X,Y,Z) =Σm(0, 3, 4, 6, 7, 8, 12)

F (W,X,Y,Z) =Y’Z’ + W’YZ + W’YZ’ F (W,X,Y,Z) =Y’Z’ + W’YZ + W’XY

 Example
Simplify the given Boolean
function
 Example (5-Variable)
Minimize a five-variable function.
f(A,B,C,D,E) = m(0,2,4,7,10,12,13,18,23,26,28,29)
C’DE’

f(A,B,C,D,E) = C’DE + BCD’ + B’CDE + A’B’D’E’

A’ A
DE DE
D’E’ D’E DE DE’ D’E’ D’E DE DE’
BC BC
B’C’ 1 0 1 3 1 2
B’C’
16 17 19 1 18
B’C 1 4 5
1 7 6
B’C
20 21
123 22

BC BC 1 28 1 29
1 12 1 13 15 14 31 30

BC’ 8 9 11
1 10 BC’ 24 25 27 126

A’B’D’E’ BCD’ B’CDE

 Example (6-Variable)
• Example:
– F = Σ (0, 2, 4, 8, 10, 13, 15, 16, 18, 20, 23, 24,
26,
32, 34, 40, 41, 42, 45, 47, 48, 50, 56, 57, 58, 60,
61)

• Ans.:
– Since, the biggest number is 61, we need to have
6 variables to define this function.
F = Σ (0, 2, 4, 8, 10, 13, 15, 16, 18, 20, 23, 24, 26, 32, 34, 40, 41,
42, 45, 47, 48, 50, 56, 57, 58, 60, 61)
Cont.
• Hence the simplified expression becomes
F = D’F’ + ACE’F + B’CDF + A’C'E’F’ + ABCE’ +
A’BC’DEF
Cont.
• Example:
– F = Σ (0, 1, 2, 3, 4, 5, 8, 9, 12, 13, 16, 17,
18, 19,
24, 25, 36, 37, 38, 39, 52, 53, 60, 61)

• Ans.:
– Since, the biggest number is 61, we need to
have 6 variables to define this function.
Cont.
Cont.
• Hence the simplified expression becomes
F = A’B'E’ + A’C'D’ + A’D'E’ + AB’C'D + ABCE’
 Plotting POS form in K-map

 If a Boolean function is given as a product of

maxterms then the function is plotted on the map by
writing 0’s on those cells
 Problems using K-Map - POS

Q. F(A,B,C)=π(0,3,6,7) minimize the given function using

K-Map method
BC B+C B+C’ B’+C’ B’+C
A 00 01 11 10 B’ + C’

A 0 0 1 0 1
0 1 3 2
A+B+C

A 1 1 1 0 0
’ 4 5 7 6
A’ + B’

Final expression F = (B’+C’)(A’+B’)(A+B+C)

 Problems using K-Map - POS

Q. Minimize the following function using K-Map method

F(A,B,C,D)=π(3,5,7,8,10,11,12,13)
CD C+D C+D’ C’+D’ C’+D A + C’ + D’
AB 00 01 11 10
A+B 00 1 0
1 1
0 3
1 2 B’ + C + D’

A+B’ 01 1 0 0 1
4 5 7 6

A’+B’ 11 0 12
0 13
1
15
1 14
A’+ C + D
A’+B 10 0 1 0 0
8 9 11 10
A’ + B + C’
Answer F = (B’ + C+D’).(A +C’+D’).(A’+C+D).(A’+B+C’)
 Home-Work
Plot the Boolean function
Y = ABC’ + ABC + A’B’C on the K-map

Plot the boolean function

Y = A’BC’D’ + AB’C

Plot the boolean function Y = AB + BC

Plot f(abc) = ∑(0,2,6,7) in the K-map

Plot f(abcd) = ∑(1,3,4,7-10,12,15)

 Home-Work

 Represent f = ∏(0,3,6,7)

Plot function f(a,b,c)= a + b in K-map

Obtain the simplified expression in SOP and POS for the
following
Boolean functions using Karnaugh-Maps and implement the
simplified
expression by using AND/OR/INVERTER gates and Universal
gates.
F (A,B,C,D) = Σ(7,13,14,15)
F (W,X,Y,Z) = Σ(2,3,12,13,14,15)