ECE 322

LOGIC CIRCUITS AND

SWITCHING THEORY
Module 8
The Karnaugh Map Method
(Kmap)

• Don’t Care Condition

• Five(5) and Six(6) Variables
Objectives

At the end of the lesson, you as a student

should be able to :
 Derive the simplified expression using k-
mapping with five and six variables.
 Derive the simplified expression using k-
mapping with don’t care condition

L.G. Arcega
UDM-CET
DON’T CARE CONDITIONS

 The minterms of a Boolean function specify all

combinations of variable values for which a function is equal
to 1. The function is assumed to be equal to 0 for the rest of
the minterms.
 This assumption, however, is not always valid, since there
are applications in which the function is not specified for
certain variable combinations.
 CASE 1: The input combinations never occur.
The 4-bit binary code for the decimal digit has six
combinations that are not used and not expected to occur,
such as 1010, 1011, 1100, 1101, 1110, 1111
 CASE 2: The input combinations are expected to occur,
but we do not care what the outputs are in response to
these combinations 
L.G. Arcega
DON’T CARE CONDITIONS

Functions that have unspecified outputs for some input

combinations are called INCOMPLETELY UNSPECIFIED
FUNCTIONS.
 
It is customary to call the unspecified minterms of a function
don’t-care conditions.
 
A don’t-care condition is represented by X or d.
 
In choosing adjacent squares to simplify the function in the map,
the don’t-care minterms may be assumed to be either 0 or 1.

L.G. Arcega
EXAMPLE: Consider the incompletely unspecified function F
that has three (3) don’t-care conditions:
F(W,X,Y,Z) = ∑ m(1,3,7,11,15) d(W,X,Y,Z) = ∑ m(0,2,5)

L.G. Arcega
 YZ 00 01 11 10
WX
00 X 1 1 X
01 0 X 1 0
11 0 0 1 0
10 0 0 1 0

F = Z (W’+Y)

L.G. Arcega
5-VARIABLE MAP
 consists of 32 squares, one for each minterm
 consists of two (2) 4-variable maps (A,B,C,D,E)
 Variable A distinguishes between the two maps.
 One 4-variable map represents the 16 squares where A =
0.
 The other 4-variable map represents the other 16 squares
where A = 1.
 Minterms 0 through 15 belong with A = 0.
 Minterms 16 through 31 belong with A = 1.
 Each 4-variable map retains the previously defined
adjacency when taken separately.
 Each square in the A = 0 map is adjacent to the
corresponding square in the A = 1 map
L.G. Arcega
 ABC
DE 000 001 011 010 110 111 101 100
00 m0 m4 m12 m8 m24 m28 m20 m16
01 m1 m5 m13 m9 m25 m29 m21 m17
11 m3 m7 m15 m11 m27 m31 m23 m19
10 m2 m6 m14 m10 m26 m30 m22 m18
or
CDE
AB 000 001 011 010 110 111 101 100
00 m0 m1 m3 m2 m6 m7 m5 m4
01 m8 m9 m11 m10 m14 m15 m13 m12
11 m24 m25 m27 m26 m30 m31 m29 m28
10 m16 m17 m19 m18 m22 m23 m21 m20
L.G. Arcega
 ABC
DE 000 001 011 010 110 111 101 100
00
01 1 1 1 1

11 1 1 1 1

10

Consider X(A,B,C,D,E) = ∑ m(5,7,13,15,21,23,29,31)

X = A’CE + ACE
= CE (A’ + A)
= CE
by applying the so called mirror image you can obtain this function

L.G. Arcega
 CDE
AB 000 001 011 010 110 111 101 100
00 1 1

01 1 1

11 1 1

10 1 1

Consider X(A,B,C,D,E) = ∑ m(5,7,13,15,21,23,29,31)

X = CE

L.G. Arcega
6-VARIABLE MAP

 consists of 64 squares, one for each minterm

 consists of two (2) 5-variable maps (A,B,C,D,E,F) or
 consists of two (4) 4-variable maps (A,B,C,D,E,F)
 One 5-variable map represents the 32 squares where A =
0.
 The other 5-variable map represents the other 32 squares
where A = 1.
 Minterms 0 through 31 belong with A = 0.
 Minterms 32 through 63 belong with A = 1.

L.G. Arcega
 ABC
DEF 000 001 011 010 110 111 101 100
000 m0 m8 m24 m16 m48 m56 m40 m32
001 m1 m9 m25 m17 m49 m57 m41 m33
011 m3 m11 m27 m19 m51 m59 m43 m35
010 m2 m10 m26 m18 m50 m58 m42 m34

110 m6 m14 m30 m22 m54 m62 m46 m38

111 m7 m15 m31 m23 m55 m63 m47 m39
101 m5 m13 m29 m21 m53 m61 m45 m37
100 m4 m12 m28 m20 m52 m60 m44 m36

L.G. Arcega
 DEF
ABC 000 001 011 010 110 111 101 100
000 m0 m1 m3 m2 m6 m7 m5 m4
001 m8 m9 m11 m10 m14 m15 m13 m12
011 m24 m25 m27 m26 m30 m31 m29 m28
010 m16 m17 m19 m18 m22 m23 m21 m20

110 m48 m49 m51 m50 m54 m55 m53 m52

111 m56 m57 m59 m58 m62 m63 m61 m60
101 m40 m41 m43 m42 m46 m47 m45 m44
100 m32 m33 m35 m34 m38 m39 m37 m36

L.G. Arcega
 ABC
DEF 000 001 011 010 110 111 101 100
000
001 1 1 1 1
1 3
011 1 1 1 1

010

110
111 1 1 1 1
2 4
101 1 1 1 1

100
Consider Y(A,B,C,D,E,F)= ∑ (9,11,13,15,25,27,29,31,41,43,45,47,57,59,61,63
Y= A’CD’F + A’CDF + ACD’F + ACDF
Y= A’CF (D’ + D) + ACF (D’ + D)
Y= A’CF + ACF
Y= CF (A’ + A )
L.G. Arcega
Y= CF by applying the so called mirror image you can obtain this simplified function
 DEF
ABC 000 001 011 010 110 111 101 100
000
001 1 1 1 1
1 2
011 1 1 1 1

010

110
111 1 1 1 1
3 4
101 1 1 1 1

100
Consider Y(A,B,C,D,E,F) = ∑ (9,11,13,15,25,27,29,31,41,43,45,47,57,59,61,63
Y= A’CD’F + A’CDF + ACD’F + ACDF
Y= A’CF (D’ + D) + ACF (D’ + D)
Y= A’CF + ACF
Y= CF (A’ + A )
L.G. Arcega
Y= CF by applying the so called mirror image you can obtain this simplified function
 DEF
ABC 000 001 011 010 110 111 101 100
000 1 1 1 1

001
011
010 1 1 1 1

110 1 1 1 1

111
101
100 1 1 1 1

L.G. Arcega
 Thanks for your time.

Do you have any question related to our

topic for today?

PM is the key

I will try to attend to your needs as soon as

possible.

L.G. Arcega
UDM-CET