The Karnaugh Map 219

Solution
There are four 1s in the output column and the corresponding binary values are 011,
100, 110, and 111. Convert these binary values to product terms as follows:
011 h ABC
100 h ABC
110 h ABC
111 h ABC
The resulting standard SOP expression for the output X is
X = ABC + ABC + ABC + ABC
For the POS expression, the output is 0 for binary values 000, 001, 010, and 101.
Convert these binary values to sum terms as follows:
000 h A + B + C
001 h A + B + C
010 h A + B + C
101 h A + B + C
The resulting standard POS expression for the output X is
X = (A + B + C)(A + B + C)(A + B + C)(A + B + C)

Related Problem
By substitution of binary values, show that the SOP and the POS expressions derived in
this example are equivalent; that is, for any binary value each SOP and POS term should
either both be 1 or both be 0, depending on the binary value.

SECTION 4–7 CHECKUP

1. If a certain Boolean expression has a domain of five variables, how many binary
values will be in its truth table?
2. In a certain truth table, the output is a 1 for the binary value 0110. Convert this binary
value to the corresponding product term using variables W, X, Y, and Z.
3. In a certain truth table, the output is a 0 for the binary value 1100. Convert this binary
value to the corresponding sum term using variables W, X, Y, and Z.

4–8 The Karnaugh Map

A Karnaugh map provides a systematic method for simplifying Boolean expressions and,
if properly used, will produce the simplest SOP or POS expression possible, known as
the minimum expression. As you have seen, the effectiveness of algebraic simplification
depends on your familiarity with all the laws, rules, and theorems of Boolean algebra and on
your ability to apply them. The Karnaugh map, on the other hand, provides a “cookbook”
method for simplification. Other simplification techniques include the Quine-McCluskey
method and the Espresso algorithm.
After completing this section, you should be able to
u
Construct a Karnaugh map for three or four variables
u
Determine the binary value of each cell in a Karnaugh map
u
Determine the standard product term represented by each cell in a Karnaugh map
 u
Explain cell adjacency and identify adjacent cells
220 Boolean Algebra and Logic Simplification
input variable combinations. For three variables, the number
of cells is 23 = 8. For four variables, the number of cells is 24 =
The purpose of a Karnaugh map is to simplify a Boolean 16.
expression.
A Karnaugh map is similar to a truth table because it presents The 3-Variable Karnaugh Map
all of the possible values of input variables and the resulting
output for each value. Instead of being organized into columns The 3-variable Karnaugh map is an array of eight cells, as
and rows like a truth table, the Karnaugh map is an array of shown in Figure 4–25(a). In this case, A, B, and C are used for
cells in which each cell represents a binary value of the input the variables although other letters could be used. Binary
variables. The cells are arranged in a way so that simplificationvalues of A and B are along the left side (notice the sequence)
of a given expression is simply a matter of properly grouping and the values of C are across the top. The value of a given
the cells. Karnaugh maps can be used for expressions with cell is the binary values of A and B at the left in the same row
two, three, four, and five variables, but we will discuss only combined with the value of C at the top in the same column.
3-variable and 4-variable situations to illustrate the principles. For example, the cell in the upper left corner has a binary
A discus value of 000 and the cell in the lower right corner has a binary
sion of 5-variable Karnaugh maps is available on the website. value of 101. Figure 4–25(b) shows the standard product terms
The number of cells in a Karnaugh map, as well as the number that are represented by each cell in the Karnaugh map.
of rows in a truth table, is equal to the total number of possible
C 01
C
AB 01
AB
00 01 11 10 ABC ABC ABC
00 01 11 10
ABC ABC ABC ABC ABC

The 4-variable Karnaugh map is an array of sixteen cells, as

shown in Figure 4–26(a). Binary values of A and B are along
the left side and the values of C and D are across the top. The
value of a given cell is the binary values of A and B at the left
in the same row combined with the binary values of C and D
at the top in the same column. For example, the cell in the
upper right corner has a binary value of 0010 and the cell in the
lower right corner has a binary value of 1010. Figure 4–26(b)
shows the standard product terms that are represented by each
cell in the 4-variable Karnaugh map.

Cell Adjacency
The cells in a Karnaugh map are arranged so that there is only
a single-variable change between adjacent cells. Adjacency is
defined by a single-variable change. In the 3-variable map the
Cells that differ by only one variable are adjacent. 010 cell is adjacent to the 000 cell, the 011 cell, and the 110
cell. The 010 cell is not adjacent to the 001 cell, the 111 cell,
the 100 cell, or the 101 cell.
Cells with values that differ by more than one variable are not
adjacent. Physically, each cell is adjacent to the cells that are
(a) (b) immediately next to it on any of its four sides. A cell is not
adjacent to the cells that diagonally touch any of its corners.
FIGURE 4–25 A 3-variable Karnaugh map showing Boolean Also, the cells in the top row are adjacent to the corresponding
product terms for each cell. cells in the bottom row and

The 4-Variable Karnaugh Map

The Karnaugh Map 221

CD
11 10 00 01
 AB ABCD ABCD
00 01 10 11
ABCD ABCD
AB
CD (a) 10
11 10 ABCD ABCD
FIGURE 4–26 A
00 (b)
4-variable ABCD ABCD
ABCD ABCD
Karnaugh map.
01 00 ABCD ABCD
ABCD ABCD
11 01 ABCD ABCD

the cells in the outer left column are adjacent to the corresponding cells in the outer right
column. This is called “wrap-around” adjacency because you can think of the map as wrap
ping around from top to bottom to form a cylinder or from left to right to form a cylinder.
Figure 4–27 illustrates the cell adjacencies with a 4-variable map, although the same rules
for adjacency apply to Karnaugh maps with any number of cells.
01
10
AB
11 00 01 11 10
CD 00

FIGURE 4–27 Adjacent cells on a Karnaugh map are those that differ by only one
variable. Arrows point between adjacent cells.

The Quine-McCluskey Method

Minimizing Boolean functions using Karnaugh maps is practical only for up to four or
five variables. Also, the Karnaugh map method does not lend itself to be automated in the
form of a computer program.
The Quine-McCluskey method is more practical for logic simplification of functions
with more than four or five variables. It also has the advantage of being easily
implemented with a computer or programmable calculator.
The Quine-McCluskey method is functionally similar to Karnaugh mapping, but the
tabular form makes it more efficient for use in computer algorithms, and it also gives a
way to check that the minimal form of a Boolean function has been reached. This method
is sometimes referred to as the tabulation method. An introduction to the
Quine-McCluskey method is provided in Section 4–11.

Espresso Algorithm
Although the Quine-McCluskey method is well suited to be implemented in a computer
program and can handle more variables than the Karnaugh map method, the result is still
far from efficient in terms of processing time and memory usage. Adding a variable to the
function will roughly double both of these parameters because the truth table length
increases exponentially with the number of variables. Functions with a large number of
222 Boolean Algebra and Logic Simplification

variables have to be minimized with other methods such as the Espresso logic minimizer,
which has become the de facto world standard. An Espresso algorithm tutorial is available
on the website.
Compared to the other methods, Espresso is essentially more efficient in terms of reduc
ing memory usage and computation time by several orders of magnitude. There is essen
tially no restrictions to the number of variables, output functions, and product terms of a
combinational logic function. In general, tens of variables with tens of output functions can
be handled by Espresso.
The Espresso algorithm has been incorporated as a standard logic function minimiza
tion step in most logic synthesis tools for programmable logic devices. For implementing
a function in multilevel logic, the minimization result is optimized by factorization and
mapped onto the available basic logic cells in the target device, such as an FPGA (Field
Programmable Gate Array).

SECTION 4–8 CHECKUP

1. In a 3-variable Karnaugh map, what is the binary value for the cell in each of the fol
lowing locations:
(a) upper left corner (b) lower right corner
(c) lower left corner (d) upper right corner
2. What is the standard product term for each cell in Question 1 for variables X, Y, and Z?
3. Repeat Question 1 for a 4-variable map.
4. Repeat Question 2 for a 4-variable map using variables W, X, Y, and Z.

4–9 Karnaugh Map SOP Minimization

As stated in the last section, the Karnaugh map is used for simplifying Boolean expressions
to their minimum form. A minimized SOP expression contains the fewest possible terms
with the fewest possible variables per term. Generally, a minimum SOP expression can be
implemented with fewer logic gates than a standard expression. In this section, Karnaugh
maps with up to four variables are covered.
After completing this section, you should be able to
u
Map a standard SOP expression on a Karnaugh map
u
Combine the 1s on the map into maximum groups
u
Determine the minimum product term for each group on the map
u
Combine the minimum product terms to form a minimum SOP expression
u
Convert a truth table into a Karnaugh map for simplification of the represented
expression
u
Use “don’t care” conditions on a Karnaugh map

Mapping a Standard SOP Expression

For an SOP expression in standard form, a 1 is placed on the Karnaugh map for each
product term in the expression. Each 1 is placed in a cell corresponding to the value of
a product term. For example, for the product term ABC, a 1 goes in the 101 cell on a
3-variable map.
 Karnaugh Map SOP Minimization 223

When an SOP expression is completely mapped, there will be a number of 1s on the

Karnaugh map equal to the number of product terms in the standard SOP expression. The
cells that do not have a 1 are the cells for which the expression is 0. Usually, when working
with SOP expressions, the 0s are left off the map. The following steps and the illustration
in Figure 4–28 show the mapping process.
Step 1: Determine the binary value of each product term in the standard SOP expres
sion. After some practice, you can usually do the evaluation of terms mentally.
Step 2: As each product term is evaluated, place a 1 on the Karnaugh map in the cell
having the same value as the product term.

C
ABC + ABC + ABC + ABC
AB
1 1000 001 110 100
00

01
1
11
1
10
01

FIGURE 4–28 Example of mapping a standard SOP expression.

EXAMPLE 4–23

Map the following standard SOP expression on a Karnaugh map:

ABC + ABC + ABC + ABC

Solution
Evaluate the expression as shown below. Place a 1 on the 3-variable Karnaugh map in
Figure 4–29 for each standard product term in the expression.
ABC + ABC + ABC + ABC
001010110111
AB
01
C
ABC
1
00

ABC
1
01

1
1
11
ABC

10
ABC
 FIGURE 4–29

Related Problem
Map the standard SOP expression ABC + ABC + ABC on a Karnaugh map.
224 Boolean Algebra and Logic Simplification

EXAMPLE 4–24

Map the following standard SOP expression on a Karnaugh map:

ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD

Solution
Evaluate the expression as shown below. Place a 1 on the 4-variable Karnaugh map in
Figure 4–30 for each standard product term in the expression.
ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD
0011010011011111110000011010

CD 01
AB ABCD
00 00 01 11 10 1 1 ABCD

11 10
ABCD ABCD
ABCD
FIGURE 4–30 1
ABCD 11
ABCD
Related
Problem
1

Map the following standard SOP expression on a Karnaugh map:

ABCD + ABCD + ABCD + ABCD

Mapping a Nonstandard SOP Expression

A Boolean expression must first be in standard form before you use a Karnaugh map. If an
expression is not in standard form, then it must be converted to standard form by the proce
dure covered in Section 4–6 or by numerical expansion. Since an expression should be
eval uated before mapping anyway, numerical expansion is probably the most efficient
approach.

Numerical Expansion of a Nonstandard Product Term

Recall that a nonstandard product term has one or more missing variables. For example,
assume that one of the product terms in a certain 3-variable SOP expression is AB. This
term can be expanded numerically to standard form as follows. First, write the binary
value of the two variables and attach a 0 for the missing variable C: 100. Next, write the
 binary value of the two variables and attach a 1 for the missing variable C: 101. The two
resulting binary numbers are the values of the standard SOP terms ABC and ABC.
As another example, assume that one of the product terms in a 3-variable expression is
B (remember that a single variable counts as a product term in an SOP expression). This
term can be expanded numerically to standard form as follows. Write the binary value of
the variable; then attach all possible values for the missing variables A and C as follows:
B
010
011
110
111
Karnaugh Map SOP Minimization 225

The four resulting binary numbers are the values of the standard SOP terms ABC,
ABC, ABC, and ABC.

EXAMPLE 4–25

Map the following SOP expression on a Karnaugh map: A + AB + ABC.

Solution
The SOP expression is obviously not in standard form because each product term does not
have three variables. The first term is missing two variables, the second term is missing
one variable, and the third term is standard. First expand the terms numerically as follows:
A + AB + ABC
000 100 110
001 101
010
011
Map each of the resulting binary values by placing a 1 in the appropriate cell of the
3-variable Karnaugh map in Figure 4–31.
01
C
AB
1 1
00

11
01

1
11

11
10

FIGURE 4–31

Related Problem
Map the SOP expression BC + AC on a Karnaugh map.

EXAMPLE 4–26
 Map the following SOP expression on a Karnaugh map:
BC + AB + ABC + ABCD + ABCD + ABCD

Solution
The SOP expression is obviously not in standard form because each product term does
not have four variables. The first and second terms are both missing two variables, the
third term is missing one variable, and the rest of the terms are standard. First expand
the terms by including all combinations of the missing variables numerically as
follows:
BC + AB + ABC + ABCD + ABCD + ABCD
000010001100101000011011
000110011101
10001010
10011011
226 Boolean Algebra and Logic Simplification

Map each of the resulting binary values by placing a 1 in the appropriate cell of the
4-variable Karnaugh map in Figure 4–32. Notice that some of the values in the expanded
expression are redundant.
00 01 11 10 1 1
CD
AB
00

01
1
1

11

111
1
10

FIGURE 4–32

Related Problem
Map the expression A + CD + ACD + ABCD on a Karnaugh map.

Karnaugh Map Simplification of SOP Expressions

The process that results in an expression containing the fewest possible terms with the few
est possible variables is called minimization. After an SOP expression has been mapped,
a minimum SOP expression is obtained by grouping the 1s and determining the minimum
SOP expression from the map.

Grouping the 1s
You can group 1s on the Karnaugh map according to the following rules by enclosing those
adjacent cells containing 1s. The goal is to maximize the size of the groups and to minimize
the number of groups.
1. A group must contain either 1, 2, 4, 8, or 16 cells, which are all powers of two. In the
case of a 3-variable map, 23 = 8 cells is the maximum group.
2. Each cell in a group must be adjacent to one or more cells in that same group, but all
 cells in the group do not have to be adjacent to each other.
3. Always include the largest possible number of 1s in a group in accordance with rule 1.
4. Each 1 on the map must be included in at least one group. The 1s already in a group can
be included in another group as long as the overlapping groups include noncommon 1s.

EXAMPLE 4–27

Group the 1s in each of the Karnaugh maps in Figure 4–33.

CD CD
C
C
00 01 11 10 00 01 11 10
AB 01 AB 01 AB AB
00 01 1 00 01 11 1 1
00 01
00 01 111 1 11 1
11 11111 1 11
1 1 1
11 11 1
10 10 1 11
11 1 10 1
10
(b) (c)
(a) FIGURE 4–33 (d)
Karnaugh Map SOP Minimization 227

Solution
The groupings are shown in Figure 4–34. In some cases, there may be more than one way to group the 1s to form
maximum groupings.
Wrap-around adjacency

Wrap-around adjacency
AB C CD CD 00 01 11 10
C 01 AB 01 AB 00 01 11 10 AB
00 01 1 00 01 11 1 1
00 01 00 01 11 1
111 1
11 11111 1 11
1 1
1 11 11 1
10 11 1 (d)
10 10 1
10 1 1 1
(b) (c)
(a)

FIGURE 4–34

Related Problem
Determine if there are other ways to group the 1s in Figure 4–34 to obtain a minimum number of maximum groupings.

Determining the Minimum SOP Expression from the Map

When all the 1s representing the standard product terms in an expression are properly
mapped and grouped, the process of determining the resulting minimum SOP expression
begins. The following rules are applied to find the minimum product terms and the mini
mum SOP expression:
1. Group the cells that have 1s. Each group of cells containing 1s creates one product
term composed of all variables that occur in only one form (either uncomple
mented or complemented) within the group. Variables that occur both uncomple
mented and complemented within the group are eliminated. These are called
 contradictory variables.
2. Determine the minimum product term for each group.
(a) For a 3-variable map:
(1) A 1-cell group yields a 3-variable product term
(2) A 2-cell group yields a 2-variable product term
(3) A 4-cell group yields a 1-variable term
(4) An 8-cell group yields a value of 1 for the expression
(b) For a 4-variable map:
(1) A 1-cell group yields a 4-variable product term
(2) A 2-cell group yields a 3-variable product term
(3) A 4-cell group yields a 2-variable product term
(4) An 8-cell group yields a 1-variable term
(5) A 16-cell group yields a value of 1 for the expression
3. When all the minimum product terms are derived from the Karnaugh map, they are
summed to form the minimum SOP expression.
228 Boolean Algebra and Logic Simplification

EXAMPLE 4–28

Determine the product terms for the Karnaugh map in Figure 4–35 and write the result
ing minimum SOP expression.
CD 00 01 11 10 1
AB 1
00 AC
111 1
01

B
1111
11

1
10

ACD
FIGURE 4–35

Solution
Eliminate variables that are in a grouping in both complemented and uncomplemented
forms. In Figure 4–35, the product term for the 8-cell group is B because the cells
within that group contain both A and A, C and C, and D and D, which are eliminated.
The 4-cell group contains B, B, D, and D, leaving the variables A and C, which form the
product term AC. The 2-cell group contains B and B, leaving variables A, C, and D
which form the product term ACD. Notice how overlapping is used to maximize the
size of the groups. The resulting minimum SOP expression is the sum of these product
terms:
B + AC + ACD

Related Problem
For the Karnaugh map in Figure 4–35, add a 1 in the lower right cell (1010) and deter
mine the resulting SOP expression.

EXAMPLE 4–29
Determine the product terms for each of the Karnaugh maps in Figure 4–36 and write the resulting minimum SOP expression.
AB B AC D
ABC C CD CD
BC 0 1 01 00 01 11 10 00 01 11 10
AB AB AB
C
00 01 1 00 01 00 01 11 1 1
00 01
111 1 AC 1
1 11 11 1 11111 1
AC 1 11
1 AB
11 11
10 10 1 11
11 1 10 1
10
(b) ABC
FIGURE 4–36 (d)
AB (c)ABD BC
(a)
Karnaugh Map SOP Minimization 229

Solution
The resulting minimum product term for each group is shown in Figure 4–36. The minimum SOP expressions for each of
the Karnaugh maps in the figure are
(a) AB + BC + ABC
(b) B + AC + AC
(c) AB + AC + ABD
(d) D + ABC + BC

Related Problem
For the Karnaugh map in Figure 4–36(d), add a 1 in the 0111 cell and determine the resulting SOP expression.

EXAMPLE 4–30

Use a Karnaugh map to minimize the following standard SOP expression:

ABC + ABC + ABC + ABC + ABC

Solution
The binary values of the expression are
101 + 011 + 001 + 000 + 100
Map the standard SOP expression and group the cells as shown in Figure 4–37.
AB
C 01
1 11
00 01 11
AC
10
11
B

FIGURE 4–37

Notice the “wrap around” 4-cell group that includes the top row and the bottom row
 of 1s. The remaining 1 is absorbed in an overlapping group of two cells. The group of
four 1s produces a single variable term, B. This is determined by observing that within
the group, B is the only variable that does not change from cell to cell. The group of
two 1s produces a 2-variable term AC. This is determined by observing that within the
group, A and C do not change from one cell to the next. The product term for each
group is shown. The resulting minimum SOP expression is
B + AC
Keep in mind that this minimum expression is equivalent to the original standard expression.

Related Problem
Use a Karnaugh map to simplify the following standard SOP expression:
XYZ + XYZ + XYZ + XYZ + XYZ + XYZ
230 Boolean Algebra and Logic Simplification

EXAMPLE 4–31

Use a Karnaugh map to minimize the following SOP expression:

BCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD

Solution
The first term B C D must be expanded into AB C D and A B C D to get the standard
SOP expression, which is then mapped; the cells are grouped as shown in Figure 4–38.
00 01
CD
1
AB 00 01 11 10 1 1
BC 11

11 11
FIGURE 4–38 11
1
10

Notice that both groups exhibit “wrap around” adjacency. The group of eight is
formed because the cells in the outer columns are adjacent. The group of four is formed
to pick up the remaining two 1s because the top and bottom cells are adjacent. The
product term for each group is shown. The resulting minimum SOP expression is
D + BC
Keep in mind that this minimum expression is equivalent to the original standard
expression.

Related Problem
Use a Karnaugh map to simplify the following SOP expression:
WXYZ + WXYZ + WXYZ + WYZ + WXYZ

Mapping Directly from a Truth Table

You have seen how to map a Boolean expression; now you will learn how to go directly
 from a truth table to a Karnaugh map. Recall that a truth table gives the output of a
Boolean expression for all possible input variable combinations. An example of a
Boolean expres sion and its truth table representation is shown in Figure 4–39. Notice in
the truth table that the output X is 1 for four different input variable combinations. The 1s
in the output column of the truth table are mapped directly onto a Karnaugh map into the
cells corresponding to the values of the associated input variable combinations, as shown
in Figure 4–39. In the figure you can see that the Boolean expression, the truth table, and
the Karnaugh map are simply different ways to represent a logic function.

“Don’t Care” Conditions

Sometimes a situation arises in which some input variable combinations are not allowed.
For example, recall that in the BCD code covered in Chapter 2, there are six invalid
combinations: 1010, 1011, 1100, 1101, 1110, and 1111. Since these unallowed states
231

X = ABC + ABC + ABC + ABC Inputs

C
Output AB 01
Karnaugh Map SOP Minimization
X 1
ABC 00
11
00001 011 10001
0 1 0 1 0 0 1 1 01 11 10
111
00110 101
1

FIGURE 4–39 Example of mapping directly from a truth table to a Karnaugh map.

will never occur in an application involving the BCD code, they can be treated as “don’t
care” terms with respect to their effect on the output. That is, for these “don’t care” terms
either a 1 or a 0 may be assigned to the output; it really does not matter since they will
never occur.
The “don’t care” terms can be used to advantage on the Karnaugh map. Figure 4–40
shows that for each “don’t care” term, an X is placed in the cell. When grouping the 1s,
the Xs can be treated as 1s to make a larger grouping or as 0s if they cannot be used to
advan tage. The larger a group, the simpler the resulting term will be.

Inputs Output
ABCDY
0
00000 0
00011 0
111 0
00001 0 CD
11100 AB 00 01 11
0
001 10
0 00
00110 1
01100 1 01 1 ABCD
110 1 BCD
01010 XXX 11 XXXX
10101
Don’t
010
cares
 11 XX XX
01 10
10 11
11
1 1
ABC A
1 1 X
(b) + ABCD With “don’t cares” Y =
(a) Truth table Without “don’t cares” Y = ABC A + BCD

FIGURE 4–40 Example of the use of “don’t care” conditions to simplify an expression.

The truth table in Figure 4–40(a) describes a logic function that has a 1 output only
when the BCD code for 7, 8, or 9 is present on the inputs. If the “don’t cares” are used as
1s, the resulting expression for the function is A + BCD, as indicated in part (b). If the
“don’t cares” are not used as 1s, the resulting expression is ABC + ABCD; so you can see
the advantage of using “don’t care” terms to get the simplest expression.
232 Boolean Algebra and Logic Simplification

EXAMPLE 4–32

In a 7-segment display, each of the seven segments is activated for various digits. For
example, segment a is activated for the digits 0, 2, 3, 5, 6, 7, 8, and 9, as illustrated in
Figure 4–41. Since each digit can be represented by a BCD code, derive an SOP expres
sion for segment a using the variables ABCD and then minimize the expression using a
Karnaugh map.
Segment a

fe b
g

d
FIGURE 4–41 7-segment display.

Solution
The expression for segment a is

a = ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD

Each term in the expression represents one of the digits in which segment a is used.
The Karnaugh map minimization is shown in Figure 4–42. X’s (don’t cares) are
entered for those states that do not occur in the BCD code.
AB 1
BD
00
BD
01
C 00 01 11 10 1 1
A
CD 111
XXXX
11
1XX1
10

FIGURE 4–42
 From the Karnaugh map, the minimized expression for segment a is

a = A + C + BD + BD

Related Problem
Draw the logic diagram for the segment-a logic.

SECTION 4–9 CHECKUP

1. Lay out Karnaugh maps for three and four variables.
2. Group the 1s and write the simplified SOP expression for the Karnaugh map in Figure
4–29.
3. Write the original standard SOP expressions for each of the Karnaugh maps in Fig ure
4–36.
Karnaugh Map POS Minimization 233

4–10 Karnaugh Map POS Minimization

In the last section, you studied the minimization of an SOP expression using a Karnaugh
map. In this section, we focus on POS expressions. The approaches are much the same
except that with POS expressions, 0s representing the standard sum terms are placed on the
Karnaugh map instead of 1s.
After completing this section, you should be able to
u
Map a standard POS expression on a Karnaugh map
u
Combine the 0s on the map into maximum groups
u
Determine the minimum sum term for each group on the map
u
Combine the minimum sum terms to form a minimum POS expression
u
Use the Karnaugh map to convert between POS and SOP

Mapping a Standard POS Expression

For a POS expression in standard form, a 0 is placed on the Karnaugh map for each sum
term in the expression. Each 0 is placed in a cell corresponding to the value of a sum term.
For example, for the sum term A + B + C, a 0 goes in the 010 cell on a 3-variable map.
When a POS expression is completely mapped, there will be a number of 0s on the
Karnaugh map equal to the number of sum terms in the standard POS expression. The cells
that do not have a 0 are the cells for which the expression is 1. Usually, when working with
POS expressions, the 1s are left off. The following steps and the illustration in Figure 4–43
show the mapping process.
Step 1: Determine the binary value of each sum term in the standard POS expression.
This is the binary value that makes the term equal to 0.
Step 2: As each sum term is evaluated, place a 0 on the Karnaugh map in the corre
sponding cell.
C
(A + B + C)(A + B + C)(A + B + C)(A + B + C)
AB
00
 010
01 0
0
11 000 010 110 101
0
10

FIGURE 4–43 Example of mapping a standard POS expression.

EXAMPLE 4–33

Map the following standard POS expression on a Karnaugh map:

(A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)

Solution
Evaluate the expression as shown below and place a 0 on the 4-variable Karnaugh map in Figure 4–44 for each standard
sum term in the expression.
(A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D) 1100 1011
0010 1111 0011
234 Boolean Algebra and Logic AB
Simplification A+B+C+D
00 01 11 10

CD
A+B+C +DA+B +C+D
00 01 11

10
00
0
0 0

A+B+C+DA+B+C+D

FIGURE 4–44

Related Problem
Map the following standard POS expression on a Karnaugh map:
(A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)

Karnaugh Map Simplification of POS Expressions

The process for minimizing a POS expression is basically the same as for an SOP expres
sion except that you group 0s to produce minimum sum terms instead of grouping 1s to
produce minimum product terms. The rules for grouping the 0s are the same as those for
grouping the 1s that you learned in Section 4–9.
 EXAMPLE 4–34

Use a Karnaugh map to minimize the following standard POS expression:

(A + B + C)(A + B + C)(A + B + C)(A + B + C)(A + B + C)

Also, derive the equivalent SOP expression.

Solution
The combinations of binary values of the expression are

(0 + 0 + 0)(0 + 0 + 1)(0 + 1 + 0)(0 + 1 + 1)(1 + 1 + 0)

Map the standard POS expression and group the cells as shown in Figure 4–45.
AB
C 01
00 01 00 1
A
AC
00 11
0
B+C
FIGURE 4–45
10 11

AB
Karnaugh Map POS Minimization 235

Notice how the 0 in the 110 cell is included into a 2-cell group by utilizing the 0 in
the 4-cell group. The sum term for each blue group is shown in the figure and the result
ing minimum POS expression is
A(B + C)
Keep in mind that this minimum POS expression is equivalent to the original standard
POS expression.
Grouping the 1s as shown by the gray areas yields an SOP expression that is equiva
lent to grouping the 0s.
AC + AB = A(B + C)

Related Problem
Use a Karnaugh map to simplify the following standard POS expression:
(X + Y + Z)(X + Y + Z)(X + Y + Z)(X + Y + Z)

EXAMPLE 4–35

Use a Karnaugh map to minimize the following POS expression:

(B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)

Solution
The first term must be expanded into A + B + C + D and A + B + C + D to get a standard POS expression, which is then
mapped; and the cells are grouped as shown in Figure 4–46. The sum term for each group is shown and the resulting
minimum POS expression is
(C + D)(A + B + D)(A + B + C)
 Keep in mind that this minimum POS expression is equivalent to the original standard POS expression.
AB A+B+D
CD 00 01 11 10

0
00 FIGURE 4–46

0 Related Problem
01 0 0

0 A+B+C
11 C+D

0
10

Use a Karnaugh map to simplify the following POS expression:

(W + X + Y + Z)(W + X + Y + Z)(W + X + Y + Z)(W + X + Z)

Converting Between POS and SOP Using the Karnaugh Map

When a POS expression is mapped, it can easily be converted to the equivalent SOP form
directly from the Karnaugh map. Also, given a mapped SOP expression, an equivalent
POS expression can be derived directly from the map. This provides a good way to
compare
236 Boolean Algebra and Logic Simplification

both minimum forms of an expression to determine if one of them can be implemented

with fewer gates than the other.
For a POS expression, all the cells that do not contain 0s contain 1s, from which the SOP
expression is derived. Likewise, for an SOP expression, all the cells that do not contain
1s contain 0s, from which the POS expression is derived. Example 4–36 illustrates this
conversion.

EXAMPLE 4–36

Using a Karnaugh map, convert the following standard POS expression into a minimum POS expression, a standard SOP
expression, and a minimum SOP expression.
(A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)

Solution
The 0s for the standard POS expression are mapped and grouped to obtain the minimum POS expression in Figure 4–47(a).
In Figure 4–47(b), 1s are added to the cells that do not contain 0s. From each cell containing a 1, a standard product term is
obtained as indicated. These product terms form the standard SOP expression. In Figure 4–47(c), the 1s are grouped and a
minimum SOP expression is obtained.
A+B+C ABCD
ABCD
CD
CD
 00 01 11 10 00 01 11 10
AB AB
00 0 00 1 00 0 ABCD
00
00 01 11 00 ABCD ABCD ABCD

01 11 B+C+D
1111110

10 1 1 1 ABCD ABCD ABCD

0
ABCD
B+C+D
10
(a) Minimum POS: (A + B + C)(B + C + D)(B + C + D) (b) Standard SOP:
ABCD + ABCD + ABCD + ABCD + ABCD + ABCD +
ABCD + ABCD + ABCD + ABCD

CD BD

AB 00 01 11 10
100 0
00
0 BC
111
01

11 10 1110
AC
0111
BCD

(c) Minimum SOP: AC + BC + BD + BCD

FIGURE 4–47

Related Problem
Use a Karnaugh map to convert the following expression to minimum SOP form: (W + X + Y +
Z)(W + X + Y + Z)(W + X + Y + Z)(W + X + Z)