Chapter Three

Simplification of Boolean Functions

3.1 Introduction
Gate-level minimization is the design task of finding an optimal gate-level implementation of the Boolean
functions describing a digital circuit. This task is well understood, but is difficult to execute by manual
methods when the logic has more than a few inputs. Fortunately, computer-based logic synthesis tools
can minimize a large set of Boolean equations efficiently and quickly. Nevertheless, it is important that a
designer understand the underlying mathematical description and solution of the problem. This chapter
serves as a foundation for your understanding of that important topic and will enable you to execute a
manual design of simple circuits, preparing you for skilled use of modern design tools.

3.2 The Map Method

The complexity of the digital logic gates that implement a Boolean function is directly related to the
complexity of the algebraic expression from which the function is implemented. Although the truth table
representation of a function is unique, when it is expressed algebraically it can appear in many different,
but equivalent, forms. Boolean expressions may be simplified by algebraically. However, this procedure
of minimization is awkward because it lacks specific rules to predict each succeeding step in the
manipulative process. The map method presented here provides a simple and straightforward procedure
for minimizing Boolean functions. This method may be regarded as a pictorial form of a truth table. The
map method is also known as the Karnaugh map or K-map. The simplified expressions produced by the K-
map are always in one of the two standard forms: sum of products or product of sums.

 Simplification Procedure for a Boolean function with n-variables using K-map

1. Construct a K-map.
a. Consists of 2n cells/Squares,
b. Each square represents one minterm, and,
c. Rows and columns are numbered in Gray – code sequence.
d. Any two adjacent squares in the map differ by only one variable.
2. Find all groups of horizontal or vertical adjacent squares that contain 1.
a. Each group must be either rectangular or square with powers of 2 cells, such as 1,2,4,8..
b. Each group should be as large as possible.
c. Each ones (1) on the K-map must be covered at least once. The same 1 can be included
in several groups if necessary.
d. Group shouldn’t include any zeros (0).
e. Adjacency applies to both vertical and horizontal borders.
f. Grouping of variables in diagonal manner is not allowed.
3. Translate each group into a product term by eliminating any variable whose value changes from
cell to cell.
4. Sum all the product terms.

1
 Two-Variable K-Map

The two-variable map is shown in Fig. 3.1 (a). There are four minterms for two variables; hence, the map
consists of four squares, one for each minterm. The map is redrawn in (b) to show the relationship
between the squares and the two variables x and y.

FIGURE 3.1: Two-variable K-map

Example,

Simplify the given 2-variable Boolean function by using K-map.

F1= xy and F2 = x’y + xy’ + xy

FIGURE 3.2: Representation of functions in the map

 Three-Variable K-Map

A three-variable K-map is shown in Fig. 3.3 (a) there are eight minterms for three binary variables;
therefore, the map consists of eight squares. Note that the minterms are arranged, not in a binary
sequence, but in a sequence similar to the Gray code. The map redrawn in part (b) is marked with numbers
in each row and each column to show the relationship between the squares and the three variables.

2
Example:

1. Simplify the Boolean function

F (x, y, z) = ∑ (3, 4, 6, 7) = x’yz + xy’z’ + xyz’ + xyz

F = yz + xz’
FIGURE 3.4: Map for the Boolean function, F (x, y, z) = ∑ (3, 4, 6, 7) = yz + xz’

2. Simplify the Boolean function

F (x, y, z) = ∑ (0, 2, 4, 5, 6)

F = z’ + xy’
FIGURE 3.5: Map for the Boolean function, F (x, y, z) = ∑ (0, 2, 4, 5, 6)= z + xy’

3
3. For the Boolean function F = A’C + A’B + AB’C + BC

(a) Express this function as a sum of minterms.

(b) Find the minimal sum-of-products expression.

 The function can be expressed in sum-of-minterms form as

F (A, B, C) =∑ (1, 2, 3, 5, 7)

The sum-of-products expression, as originally given, has too many terms. It can be simplified, as shown
in the map, to an expression with only two terms: F = C + A’B

FIGURE 3.6: Map for the Boolean function F(A,B,C) = A’C+ A’B + AB’C + BC = C + A’B

F our – Variable K-map

The map for Boolean functions of four binary variables (w, x, y, z) is shown in Fig. 3.7 (a), are listed the
16 minterms and the squares assigned to each. (b), the map is redrawn to show the relationship
between the squares and the four variables.

FIGURE 3.7: Four-variable map

4
Example,

1. Simplify the Boolean function F (w, x, y, z) =Ʃ (0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14)

F = y’ + w’z’ + xz’
FIGURE3.8: Map for the Boolean function F (w, x, y, z) =Ʃ (0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14) = y’ + w’z’ + xz’

2. Simplify the Boolean function F(A,B,C,D) = A’B’C’ + B’CD’ + A’BCD’ + AB’C’

 F = B’D’ + B’C’ + A’CD’

FIGURE3.9: Map for the Boolean function F(A,B,C,D) = A’B’C’ + B’CD’ + A’BCD’ + AB’C’= B’D’ + B’C’ + A’CD’

Five-Variable Map

Maps for more than four variables are not as simple to use as maps for four or fewer variables. A five-
variable map needs 32 squares and a six-variable map needs 64 squares. When the number of variables
becomes large, the number of squares becomes excessive and the geometry for combining adjacent
squares becomes more involved. Maps for more than four variables are difficult to use and will not be
considered here.

5
3.2 product of Sums Simplification
If we mark the empty squares by 0’s rather than 1’s and combine them into valid adjacent squares, we
obtain the complement of the function, F’. Use the DeMorgan’s theorem, we can get the product of
sums.

Example, Simplify the following Boolean function F (A, B, C, D) = ∑(0, 1, 2, 5, 8, 9, 10) into
(a) sum-of-products form and
(b) product-of-sums form

(a) Combining the squares with 1’s gives the simplified function in sum-of-products form:
F = B’D’ + B’C’ + A’C’D

(b) If the squares marked with 0’s are combined, as shown in the diagram, we obtain the simplified
complemented function:
 F’ = AB + CD + BD’
By applying DeMorgan’s theorem, we obtain the simplified function in productof-sums form:
 F = (A + B) (C + D) (B + D)

6
3.3 Don’t - Care Conditions
The logical sum of the minterms associated with a Boolean function specifies the conditions under which
the function is equal to 1. The function is equal to 0 for the rest of the minterms. This pair of conditions
assumes that all the combinations of the values for the variables of the function are valid.

In practice, in some applications the function is not specified for certain combinations of the variables. As
an example, the four-bit binary code for the decimal digits has six combinations that are not used and
consequently are considered to be unspecified.

The unspecified combinations (min-terms) are called don’t-care conditions, and they are used on the map
to provide further simplification.

Don’t-care conditions:

Are marked by X in the map

Are assumed to be either 0 or 1, depending on which combination gives the simplest expression.

Example, Simplify the Boolean function F (w, x, y, z) = ∑(1, 3, 7, 11, 15)

which has the don’t-care conditions D (w, x, y, z) = ∑(0, 2, 5)

FIGURE3.10: Example with don’t-care conditions

3.4 NAND and NOR Implementation

Digital circuits are more frequently constructed with NAND or NOR gates than with AND and OR gates.

 Easier to fabricate with electronic components.

 They are the basic gates used in all IC.

Rules and procedures have been developed for the conversion from Boolean functions given in terms of
AND, OR, and NOT into equivalent NAND or NOR logic diagrams.

7
 NAND Implementation

The implementation of a Boolean function with NAND gates requires that the function be simplified in
the sum of products form.

 NOR Implementation

The implementation of a Boolean function with NOR gates requires that the function be simplified in
product of sums form.