Ministry of Higher Education and Scientific Research

Technology University

Department of Control Engineering and Systems

2019
 Minimization of Logic Function

1- Tabular method (Quine - McCluskey's method)

2- Bridging Technique

Quine - McClusky Minimization Procedure :

step 1 Describe individual min terms of the given expression by their equivalent binary
numbers .

step 2 For a table by grouping numbers with equivalent number of 1's in them i.e first
number with no 1's , then number with one 1 , and then number with two 1's ,....etc .

step 3 Compare each number in the top group with each min term in the next lower
group . If the two numbers are the same in every position but one , place a check sing (√ )
to the right of both numbers to show that they have been paired and covered . Then
enterd the newly formed number in the next column (a new table ). The new number is
the old numbers but where the literal differ , an ( - ) is placed in the position of that literal.

step 4 Compare numbers to numbers in the next group that have the same (-) position

step 5 Terms which were not covered are the prime implicates and ORed and ANDed
together to form final function .

NOTE: The procedure above gives the prime implicant but not essential prime implicant

1
Ex1 / Simplify the following Boolean function by using the tabulation method .

F = Ʃ (0 , 1 , 2 , 8 , 10 , 11 , 14 , 15)

a b c
WXYZ

0 0 0 0 0√ 0,1 000-* 0,2,8,10 -0-0

0,2 0 0 - 0√ 0,8,2,10 -0-0
1 0 0 0 1√ 0,8 - 0 0 0√
2 0 0 1 0√ 10,11,14,15 1-1-
8 1 0 0 0√ 2,10 - 0 1 0√ 10,14,11,15 1-1-
8,10 1 0 - 0√
10 1 0 1 0√
10,11 101-√
11 1 0 1 1√ 10,14 1-10√
14 1 1 1 0√ 11,15 1-11√
14,15 111-√
15 1 1 1 1√
F = 000 - + - 0 - 0 + 1 - 1 -
F=WXY+XZ+WY

min
terms
0 1 2 8 10 11 14 15
P.IS

000- * √ √

-0-0 * √ √ √ √

1-1- * √ √ √ √

2
Ex2 / Minimize the following Boolean function by using the tabulation method .

F = Ʃ (0 , 4 , 5 , 6 , 11 , 12 , 13 , 14 , 15)

a b c d

0 0 0 0 0√ 0,4 0 - 0 0 ** 4,5,12,13 -10- Z

6,4,12,14 - 1-0
4 0 1 0 0√ 4,5 010- 4,12,5,13 -10-
4,6 01-0 4,12,6,14 -1-0 W
5 0 1 0 1√ 4,12 -100 12,13,14,15 11-- V
6 0 1 1 0√ 12,14,13,15 11--
12 1 1 0 0√ 5,13 -101
6,14 -110
11 1 0 1 1√ 12,13 110-
13 1 1 0 1√ 12,14 11-0
14 1 1 1 0√
11,15 1-11*Y
15 1 1 1 1 13,15 11-1
14,15 111-

P.I's are :
X=acd
Y=acd
Z=bc
W=bd
V=ab

3
To find the essential P.I 's we can form a table of choice

Choice Table:

P.I's minterms
0 4 5 6 11 12 13 14 15
(0,4) acd*
√ √
(11,15) acd*
√ √
(4,5,12,13) b c*
√ √ √ √
(6,4,12,14) bd*
√ √ √ √
(12,13,14,15) ab*
√ √ √ √

F=acd+acd+bc+bd

4
Ex2 / Minimize the following Boolean function by using the tabulation method .

F = Ʃm (3 , 5 , 7, 8 , 10, 11 , 12 , 13, 15) + d(0,2)

a b c d

0 0 0 0 0√ 0,2 00-0* 0,8, 2,10 -0-0

0,8 - 0 0 0√ 2,3,10,11 - 10-
2 0 0 1 0√ 2,3 001-√ 2,10,3,11 -10-
8 1 0 0 0√ 2,10 -010√ 3,7,11,15 --11
3 0 0 1 1√ 8,12 1-00* 3,11,7,15 --11
5 0 1 0 1√ 8,10 1 5,7,13,15 -1-1
10 1 0 1 0√ 3,7 0-11√ 5,13,7,15 -1-1
12 1 1 0 0√ 3,11 -011√
7 0 1 1 1√ 5,7 01-1√
11 1 0 1 1√ 5,13 -101√
13 1 1 0 1√ 10,11 101-*
12,13 110-*
15 1 1 1 1√
7,15 -111√
11,15 1-11√
13,15 11-1√

5
Choice table:

min
terms
3 5 7 8 10 11 12 13
P.IS

1-00 √ √
101- √ √
110- √ √
-0-0 √ √
-01- √ √ √
--11 √ √ √ √
-1-1* √ √ √ √

set1 set2 set3

1-00 -0-0 -01-
101- --11 1-00
-10- 110-

F(a,b,c,d) = -1-1 + -01- +1-00

=b d + b c + a c d

6
Bridging Technique :

This Technique make use of the Ex - OR function , ANDing or ORing with a function.

AB
CD 00 01 11 10

00 0 1 0 1
01 1 0 1 0
11 0 1 0 1
01 1 0 1 0

F=A B C D

NOTE : For missing 1's using AND gates

For missing 0's using OR gates

7
Ex 1/ Implement the function :

F = Ʃm ( 2,7,8,11,13, )
For missing 1's

sol /

F2 F1 G1
0 0 x F2 = F1 . G1
0 1 0
1 0 not exist
desired X-OR
1 1 1

AB
00 01 11 10
CD

0 0 0 1 0 1 0 1 00 x 0 x 1
0 0 1 0 1 0 1 0 . 01 0 x 1 x
0 1 0 1
= 00 x 1 x 1
0 1 0 1
1 0 1 0 1 0 1 0 10 1 x 1 x

F2 F1 G1

F2 = ( A B C D)(A + C)

A
B
C
D
F
A
C

8
Ex 2/ Implement the function :

F = Ʃm ( 0,1,2,4,7,8,11,10,13,14 )
For missing 0's

sol /

F2 F1 G1
0 0 0 F2 = F1 . G1
0 1 not exist
1 0 1
desired X-OR
1 1 x

AB
00 01 11 10
CD

1 1 0 1 0 1 0 1 00 1 x 0 x
1 0 1 0 1 0 1 0 01 x 0 x 0
0 1 0 1
= +
00 0 x 0 x
0 1 0 1
1 0 1 1 1 0 1 0 10 x 0 x 1

F2 F1 G1

F2 = ( A B C D) + B D

A
B
C
D
F
B
C

9
NOTE: For missing 0's and 1's use OR and AND gates respectively

F2 =( F1 + G1) G2

Ex / Implement the function F = Ʃm ( 0,1,2,4,7,8,11,10,13,14 ) For missing 0's and

1's

AB AB
CD CD
00 01 11 10

1 1 0 1 0 1 0 1 00 0 d 0 d
1 0 1 0 1 0 1 0 01 1
d 0 d
= + .
0 1 0 1 0 1 0 1 00 0 d 0 d
1 0 1 1 1 0 1 0 10 d 0 d 0
F2 F1 G1

AB L3
CD

d 1 d 1 L2

1 d 1 1
1 L1
d 1 d
0 d 1 x

G2

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

10