124

FOUNDATION OF SWITCHING THEORY AND LOGIC DESIGN

22.

Simplify the Boolean function by tabular method

F(A, B, C, D, E) = (0, 1, 4, 5, 16, 17, 21, 25, 29)

23.

Simplify the following function in

(a) so-p

and

(b) pos

F(A, B, C, D) = (3, 4, 6, 7, 11, 12, 13, 14, 15)

24.

Simplify the Boolean function using tabular method.

F(A, B, C, D, E) = (0, 1, 4, 5, 16, 17, 21, 25, 29, 30)

25.

Simplify the Boolean function using tabular method

F(A, B, C, D, E, F) = (6, 9, 13, 18, 19, 27, 29, 41, 45, 57, 61, 63)

3.3 MINIMIZATION USING QUINE-McCLUSKEY (TABULAR) METHOD

The K-map method is suitable for simplification of Boolean functions up to 5 or 6
variables. As the number of variables increases beyond this, the visualization of adjacent
squares is difficult as the geometry is more involved.
The Quine-McCluskey or Tabular method is employed in such cases. This is a systematic step by step procedure for minimizing a Boolean expression in standard form.

Procedure for Finding the Minimal Expression

1.

Arrange all minterms in groups, such that all terms in the same group have same
number of 1s in their binary representation. Start with the least number of 1s and
continue with grouping of increasing number of 1s, the number of 1s in each term
is called the index of that term i.e., all the minterms of same index are placed in
a same group. The lowest value of index is zero. Separate each group by a thick
line. This constitutes the I stage.

2.

Compare every term of the lowest index (say i) group with each term in the
successive group of index (say, i + 1). If two minterms differ in only one variable,
that variable should be removed and a dash () is placed at the position, thus a new
term with one less literal is formed. If such a situation occurs, a check mark () is

BOOLEAN FUNCTION MINIMIZATION TECHNIQUES

125

placed next to both minterms. After all pairs of terms with indices i and (i + 1) have
been considered, a thick line is drawn under the last terms.
When the above process has been repeated for all the groups of I stage, one stage
of elimination have been completed. This constitutes the II stage.
3. The III stage of elimination should be repeated of the newly formed groups of
second stage. In this stage, two terms can be compared only when they have dashes
in same positions.
The process continues to next higher stages until no further comparisons are
possible. (i.e., no further elimination of literals).
4. All terms which remain unchecked (No sign) during the process are considered
to be prime implicants (PIs). Thus, a set of all PIs of the function is obtained.
5. From the set of all prime implicates, a set of essential prime implicants (EPIs) must
be determined by preparing prime implicant chart as follow.
(a) The PIs should be represented in rows and each minterm of the function in a column.
(b) Crosses should be placed in each row corresponding to minterms that makes
the PIs.
(c) A complete PIs chart should be inspected for columns containing only a single
cross. PIs that cover minterms with a single cross in their column are called EPIs.
6. The minterms which are not covered by the EPIs are taken into consideration and
a minimum cover is obtained form the remaining PIs.
Now to clarify the above procedure, lets do an example step by step.
Example 1. Simplify the given function using tabular method.
F (A, B, C, D) = (0, 2, 3, 6, 7, 8, 10, 12, 13)
Solution. 1. The minterms of the function are represened in binary form. The binary
represented are grouped into a number of sections interms of the number of 1s index as
shown in Table of Fig. 3.15.
Minterms

Binary
ABCD

No.
of 1's

Minterms
Group

Index

m0

0000

m0

m2

0010

m2

m3

0011

m8

m6

0110

m3

m7

0111

m6

m8

1000

m 10

m 10

1010

m 12

m 12

1100

m7

m 13

1101

m 13

Binary
ABCD
0000
0010

1000
0011

0110
1010
1100
0111

1101

Fig. 3.15

2.

Compare each binary term with every term in the adjacent next higher category.
If they differ only by one position put a check mark and copy the term into the next
column with () in the place where the variable is unmatched, which is shown in
next Table of Fig. 3.16.

126

FOUNDATION OF SWITCHING THEORY AND LOGIC DESIGN

Minterm

Binary

Group

0, 2

0, 8

2, 3

2, 6

2, 10

8, 10

8, 12

PI

3, 7

6, 7

12, 13

PI

Fig. 3.16

Minterm

Binary

Group

A B C D

0, 2, 8, 10

PI

0, 8, 2, 10

PI eliminated

2, 3, 6,

PI

2, 6, 3,

PI eliminated.

Fig. 3.17

3.

Apply same process to the resultant column of Table of Fig. 3.16 and continue until
no further elimination of literals. This is shown in Table of Fig. 3.17 above.

4.

All terms which remain unchecked are the PIs. However note that the minterms
combination (0, 2) and (8, 10) form the same combination (0, 2, 8, 10) as the
combination (0, 8) and (2. 10). The order in which these combinations are placed
does not prove any effect. Moreover, as we know that x + x = x, thus, we can
eliminate one of these combinations.
The same occur with combination (2, 3) and (6, 7).

5.

Now we prepare a PI chart to determine EPIs as follows shown in Table of Fig. 3.18.
Minterms
Prime Implicants

(8, 12)

10

(12, 13)

(0, 2, 8, 10)

(2, 3, 6, 7)

12

Fig. 3.18

13

BOOLEAN FUNCTION MINIMIZATION TECHNIQUES

6.

127

(a)

All the PIs are represented in rows and each minterm of the function in a
column.

(b)

Crosses are placed in each row to show the composition of minterms that
make PIs.

(c)

The column that contains just a single cross, the PI corresponding to the row
in which the cross appear is essential. Prime implicant. A tick mark is part
against each column which has only one cross mark. A star (*) mark is placed
against each. EPI.

All the minterms have been covered by EPIs.

Finally, the sum of all the EPIs gives the function in its minimal SOP form
EPIs.

Binary representation

Variable Representation

12, 13

ABC'

0, 2, 8, 10

B'D'

2, 3, 6, 7

A'C

Therefore,

F = ABC' + B'D' + A'C.

If don't care conditions are given, they are also used to find the prime implicating, but
it is not compulsory to include them in the final simplified expression.
Example 2. Simplify the given function using tabular method.
F(A, B, C, D) = (0, 2, 3, 6,7)
d (5, 8, 10, 11, 15)
Solution. 1. Step 1 is shown in Table of Fig. 3.19. The dont care minterms are also
included.
Minterms

Binary
ABCD

No.
of 1s

Minterms
Group

Index

m0
m2
m3
m5
m6
m7
m8
m 10
m11
m 15

0000
0010
00 11
0101
0110
0111
1000
1010
1011
1111

0
1
2
2
2
3
1
2
3
4

m0
m2
m8
m3
m5
m6
m 10
m7
m11
m 15

Fig. 3.19

2.

Step 2 is shown in Table of Fig. 3.20.

3.

Step 3 is shown in Table of Fig. 3.21.

1
2

3
4

Binary
ABCD
0000
0010
1000
0011
0101
0110
1 0 1 0
0111
1011
1111

128

FOUNDATION OF SWITCHING THEORY AND LOGIC DESIGN

Minterm
Group

Binary
A

0,

0,

2,

2,

2, 10

8, 10

3,

3, 11

5,

1 PI

6,

10, 11

7, 15

11, 15

Fig. 3.20

Minterm

Binary

Group

A B C D

0, 2, 8, 10

PI

0, 8, 2, 10

PI Eliminated

2, 3, 6, 7

PI

2, 3 10, 11

PI

2, 6, 3, 7

PI Eliminated

2, 10, 3, 11

PI Eliminated

3, 7, 11, 15

PI

3, 11, 7, 15

PI Eliminated

Fig. 3.21

4.

All the terms which remain unchecked are PIs. Moreover, one of two same combinations is eliminated.

5.

Step 5 is to prepare a PI chart to determine EPIs as shown in Table of Fig. 3.22.

Note, however, that dont care minterms will not be listed as column headings in
the chart as they do not have to be covered by the minimal (simplified) expression.

BOOLEAN FUNCTION MINIMIZATION TECHNIQUES

Prime Implicants

Minterms
0

(5, 7)

(0, 2, 8, 10)

(2, 3, 6, 7)

(2, 3, 10, 11)

(3, 7, 11, 15)

Fig. 3.22

6.

All the minterms have been covered by EPIs.

Therefore

F (A, B, C, D) = B'D' + A'C

Example 3. Simplify the given function using tabular method:

F (A, B, C, D, E, F, G) = (20, 28, 38, 39, 52, 60, 102, 103, 127)
Solution. Step 1 is shown in Table of Fig. 3.23.
Minterms

Binary
ABCDEFG

No.
of 1s

Minterms
Group

Index

Binary
ABCDEFG

m 20
m 28
m 38
m 39
m 52
m 60
m 102
m 103
m 127

0010100
0011100
0100110
0100111
0110100
0111100
1100110
1100111
11 1 1 1 1 1

2
3
3
4
3
4
4
5
7

m 20
m 28
m 38
m 52
m 39
m 60
m 102
m 103
m 127

0010100
0011100
0100110
0110100
0100111
0111100
1100110
1100111
1111111

3
4

5
7

Fig. 3.23

2.

Step 2 is shown in Table (Fig. 3.24).

3.

Step 3 is shown in Table (Fig. 3.25).

Minterms
Group
20,
28
20,
52
28,
60
38,
39
38, 102
52,
60
39, 103
102, 103

Binary
A B C
0 0 1
0 1
0 1
0 1 0
1 0
0 1 1
1 0
1 1 0
Fig. 3.24

0
1
0
0

0
0

E
1
1
1
1
1
1
1
1

F
0
0
0
1
1
0
1
1

G
0
0
0

0
0
1

PI

129

130

FOUNDATION OF SWITCHING THEORY AND LOGIC DESIGN

Mintesms

Binary

Group

A B C D E F G

20, 28, 52, 60

PI

20, 52, 28, 60

PI Eliminated

38, 39 102, 103

PI

38, 102, 39, 103

PI Eliminated

Fig. 3.25

4.

All the terms which remain unchecked are PIs. Moreover one of two same combinations is eliminated.

5.

PI chart to determine EPIs is shown in Table Fig. 3.26.

Prime Implicants

Minterms
20

127

(20, 28, 52, 60)

28

38

39

52

60

102 103 127

(38, 39, 102, 103) *

Fig. 3.26

6.

All the minterms have been covered by EPIs.

Therefore, F (A, B, C, D, E, F, G) = ABCDEFG + A'CEF'G' + BC'D'EF

3.4 EXERCISE
1.

Using Boolean algebra simplify each of the following logic expressions as much as
possible:
(a) Z = A(A + AB) (A + ABC) (A + ABCD)
(b) C = (X1X2 + X2 X3 )

2.

Draw the simplest possible logic diagram that implements the output of the logic
diagram given below.

A
B

3.

Write the logic expression and simplify it as much as possible and draw a logic
diagram that implements the simplified expression.

BOOLEAN FUNCTION MINIMIZATION TECHNIQUES

131

B
C

4.

Obtain the simplified expression in s-of-p for the following Boolean functions:
(a)

xy + x y z + x yz

(b) ABD + ACD + AB + ACD + ABD

(c)

x z + w xy + w( x y + xy )

(d) F (x, y, z) = (2, 3, 6, 7)

(e)
5.

F (A , B, C, D) = (7, 13, 14, 15)

Use a K-map to simplify each of the following logic expressions as much as possible:
(i)

F = AB + A B + AB

(ii) G = X Y Z + X YZ + XY Z + X Y Z + XYZ
(iii) H = A B CD + AB C D + A B C D + ABC D + A B C D + AB C D + ABCD
(iv) W = X Y Z + X YZ + XYZ + XY Z + X YZ
6.

Simplify the following logic expressions using K-maps and tabular method.
(a) F(A, B, C) = AC + BC+ABC
(b) G(A, B, C, D) = BCD + CD + ABCD + ABC

7.

Simplify the Boolean function F(ABCDE) = (0, 1, 4, 5, 16, 17, 21, 25, 29)

8.

Simplify the following Boolean expressions using K-maps and Tabular method.
(i)

BDE + BCD + CDE + ABCE + ABC + BCDE

(ii) ABCE + ABCD + BDE + BCD + CDE + BDE

(iii) F(ABCDEF) = (6, 9, 13, 18, 19, 27, 29, 41, 45, 57, 61)
9.

Draw Karnaugh maps for the following expressions:

F = A .B .C + A .B .C + A .B .C + A .B.C
F = A .B.C + A .B.C + A .B.C + A .B.C + A .B .C
F = A . B . C . D + A .B . C . D + A . B . C. D + A .B .C . D + A . B . C .D
+ A B . C. D + A .B .C.D + A B.C.D

10.

Simplify the following logic expressions using karnaugh maps. Draw logic diagrams
for them using only (a) NAND, (b) NOR gates, assuming inputs A, B, C, and D only
are available.
Y = A . B . C . D + A .B . C . D + A . B . C. D + A .B .C. D + A . B . C .D
+ A .B .C.D + A .B.C.D

132

FOUNDATION OF SWITCHING THEORY AND LOGIC DESIGN

Y = A . B . C . D + A .B . C. D + A . B . C. D + A .B.C. D + A . B . C.D + A .B .C.D

Y = A . B . C . D + A .B . C . D + A . B . C . D + A .B .C . D+ A . B . C.D + A .B.C .D
+ A .B .C.D + A .B .C.D + A .B .C .D + AB .C.D
Y = A .B.C .D + A .B .C .D + A .B .C .D + A .B.C.D + A .B.C.D

11.

The institutes pool room has four pool tables lined up in a row. Although each table
is far enough from the walls of the room, students have found that the tables are
too close together for best play. The experts are willing to wait until they can
reserve enough adjacent tables so that one game can proceed unencombered by
nearby tables. A light board visible outside the pool room shows vacant tables. The
manager has developed a digital circuit that will show an additional light whenever
the experts desired conditions arise. Give a logic equation for the assertion of the
new light signal. Simplify the equation using a K-Map.

12.

Simlify the Boolean functions using tabular method and verify result with K-map.
(a) F (w, x, y, z) = ( 0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14)
(b) F (w, x, y, z) = (2, 3, 12, 13, 14, 15)
(c)

F (A , B , C, D) = ( 4 , 6, 7, 15)

(d) F (A , B , C, D) = (7, 13, 14, 15)

(e)
13.

14.

F ( x, y, z) = (7, 13, 14, 15)

Simplify the Boolean function F using the dont care conditions d, in (I) SOP and
(II) POS:
F = A B D + A CD + A BC

d = A BC D + ACD + AB D

F = w ( x y + x y + xyz ) + x z ( y + w)

d = w x ( y z + yz ) + wyz

F = ACE + A CD E + A C DE

d = DE + A D E + AD E

Use a Karnaugh map to simplify each of the following logic expressions as much
as possible.
(a) F = A B CD + AB C D + A B CD + ABC D + ABCD
Solution. F = ABD + ABD + BC
(b) G = A C + B C + AB C + A B
Solution. G = AB + A B + A C or AB + A B + B C
(c)

H = B CD + CD + A B C D + A B C

Solution. H = B CD + CD + A B C D + A B C
(d) F = ( A + B + C ) (A + B + C) (A + B + C )
Solution. F = B + AC
15.

Use a Karnaugh map to simplify each of the following logic expressions as much
as possible.
(a) W = (AB C ) ( AB C) (ABC)

BOOLEAN FUNCTION MINIMIZATION TECHNIQUES

133

(b) M = X2X 3 + X 1 X 2 X 3 + X 3 + X1X 2 X 3

16.

Using Boolean Algebra simplify

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

17.

(d) (A + A ) (AB + AB C)

(c)

AB + ABC + A

(e)

AB + (A + B )C + AB

Use a karnaugh map to simplify each function to a minimum sum-of-products form:

(a) X = A B C + A B C + AB C
(c)

18.

(b) A B + AB C + ABCD + AB C DE

(b) X = AC [B + A (B + C)]

X = DEF + DEF + D E F

F1

F2

Transfer the input-output specifications for F1 and F2 given above to 3 variable

Karnaugh maps.
19.

Using a Karnagh map simplify the following equations

(a) X = A B + AC + BC + AB + A C + A B C + ABC
(b) X = A B C + ACD + AB C + B C D + A B C + AB D + A B CD
(c) X = D ( A [ C + B C] + A [ C + B C]) + BCD
(d) X = A B C + B CD + ABD + ABCD + A CD + AB C D

20.

21.

Simplify the following using Boolean Algebra

(a)

z = w. x + w. x . y

(b)

z = ( x + y) . ( x + y )

(c)

z = x. y + w. y + w. x + x. y. v

(d)

z = ( x + y).( x + w ).[ y.( x + w ) + y ]

Consider the function

z = f ( x, y, w, v) = ( x. v + x . w). y .( w + y. v )

(a) Draw a schematic diagram for a circuit which would implement this function.