Chapter3: Gate-Level Minimization

Lecture4- Function Simplification using Quine

McCluskey Minimization Algorithm
Engr. Arshad Nazir, Asst Prof
Dept of Electrical Engineering
SEECS
EE-223 Digital Logic Design Spring 2024 1
EE-223 Digital Logic Design Spring 2024 2
 Objectives
• Functions Simplification in Sum-of-Products (SOP) form
using Quine McCluskey Minimization Algorithm

EE-223 Digital Logic Design Spring 2024 3

 Function Simplification using
Quine McCluskey Method
• The Quine-McCluskey method is an exact algorithm which finds
minimum cost sum-of-products implementation of a Boolean
function.
• There are four steps in the Quine-McCluskey algorithm:
❑ Generate Prime Implicants
❑ Construct Prime Implicant Table
❑ Reduce the Prime Implicant Table by
– Removing Essential Prime Implicants
– Column Dominance
– Row Dominance
❑ Solve Prime Implicant Table by (i) Petrick’s Method (ii)
Branching Method

EE-223 Digital Logic Design Spring 2024 4

 Example
f(a,b,c,d,e)=∑m(1,3,4,5,6,7,10,11,12,13,14,15,
18,19,20,21,22,23,26,27)

EE-223 Digital Logic Design Spring 2024 5

 Group minterms Variables
Example Cont… abcde
0 1 00001
4 00100
❑ minterms sorted into 1 3 00011
groups according to number 5 00101
of 1’s in each term. 6 00110
10 01010
12 01100
18 10010
20 10100
2 7 00111
11 01011
13 01101
14 01110
19 10011
21 10101
22 10110
26 11010
3 15 01111
23 10111
27 2024
EE-223 Digital Logic Design Spring 11011 6
 Column 1
Group minterms abcde

0 1 0 0 0 0 1
4 0 0 1 0 0
1 3 0 0 0 1 1
5 0 0 1 0 1
6 0 0 1 1 0
10 0 1 0 1 0
12 0 1 1 0 0
18 1 0 0 1 0
20 1 0 1 0 0
2 7 0 0 1 1 1
11 0 1 0 1 1
13 0 1 1 0 1
14 0 1 1 1 0
19 1 0 0 1 1
21 1 0 1 0 1
22 1 0 1 1 0
26 1 1 0 1 0
3 15 0 1 1 1 1
23 1 0 1 1 1
EE-223 Digital Logic Design Spring 2024 7
27 1 1 0 1 1
 Column3 Column4

Gp minterms abcde Gp minterms abcde

0 1,3,5,7 0 0 - - 1 0 4,5,6,7,12,13,14,15 0 - 1 - -
4,5,6,7 0 0 1 - - 4,5,6,7,20,21,22,23 - 0 1 - -
4,5,12,13 0 - 1 0 - 4,5,12,13,6,7,14,15 0-1--
4,5,20,21 - 0 1 0 - 4,5,20,21,6,7,22,23 -01--
4,6,12,14 0 - 1 - 0 4,6,12,14,5,7,13,15 0-1--
4,6,20,22 - 0 1 - 0 4,6,20,22,5,7,21,23 -01--

1 3,7,11,15 0 - - 1 1
3,7,19,23 - 0 - 1 1
3,11,19,27 - - 0 1 1 The Prime implicants generated:-
5,7,13,15 0 - 1 - 1 a′b′e ∑(1,3,5,7)
5,7,21,23 - 0 1 - 1 a′d e ∑(3,7,11,15)
6,7,14,15 0 - 1 1 -
b′d e ∑(3,7,19,23)
6,7,22,23 - 0 1 1 -
10,11,14,15 0 1 - 1 - c′d e ∑(3,11,19,27)
10,11,26,27 - 1 0 1 - a′bd ∑(10,11,14,15)
12,13,14,15 0 1 1 - - bc′d ∑(10,11,26,27)
18,19,22,23 1 0 - 1 - ab′d ∑(18,19,22,23)
18,19,26,27 1 - 0 1 - ac′d ∑(18,19,26,27)
20,21,22,23 1 0 1 - - a′c ∑(4,5,6,7,12,13,14,15)
b′c Spring
EE-223 Digital Logic Design ∑(4,5,6,7,20,21,22,23)
2024 8
Prime Implicant Table

EE-223 Digital Logic Design Spring 2024 9

 Reduced Prime Implicant Table
❖ The Prime Implicant Table was
constructed in the previous slide. PIs 10 11 18 19 26 27

❖ Essential Prime Implicants (EPIs) a′de (3,7,11,15) ×

identified and eliminated from the table
b′de (3,7,19,23) ×
and corresponding minterms also
struck. c′de (3,11,19,27) × × ×
❖ The Essential Prime Implicants (EPIs) a′bd (10,11,14,15) × ×
obtained in this way are:-
_ a′b′e ∑(1,3,5,7) bc′d (10,11,26,27) × × × ×

_ a′c ∑(4,5,6,7,12,13,14,15) ab′d (18,19,22,23) × ×

_ b′c ∑(4,5,6,7,20,21,22,23)
ac′d (18,19,26,27) × × × ×
❖ Now we can construct Reduced Prime
Implicant Table and apply column
dominance to reduce it further.
❖ Eliminate dominating column. EE-223 Digital Logic Design Spring 2024 10
 Further Reduced Prime Implicant
Table
❖ The table is further reduced by PIs 10 18 26
applying Column Dominance. a′bd (10,11,14,15) ×
❖ We can now apply Row Dominance
bc′d (10,11,26,27) ×
and eliminate dominated rows.
❖ Rows bc′d and ac′d dominate a′bd ab′d (18,19,22,23) ×
and ab′d. Hence dominated rows a′bd
ac′d (18,19,26,27) ×
and ab′d can be eliminated. The
secondary EPIs bc′d and ac′d cover all
minterms and are selected for
minimal solution.
❖ We can also apply row dominance f(a,b,c,d,e)=a′b′e+a′c+b′c+bc′d+ac′d
first and then column dominance.

EE-223 Digital Logic Design Spring 2024 11

 Petrick Method
❖ In Petrick’s method, a Boolean expression P
PIs 10 11 18 19 26 27
is formed which describes all possible
solutions of the table.
❖ The prime implicants in the table are p1 a′de (3,7,11,15) ×
numbered in order, from 1 to 6. For each
p2 b′de (3,7,19,23) ×
prime implicant pi, a Boolean variable Pi is
used which is true whenever prime implicant p3 c′de (3,11,19,27) × × ×
pi is included in the solution.
p4 a′bd (10,11,14,15) × ×
❖ Remember that pi is prime implicant
whereas Pi is corresponding Boolean p5 bc′d (10,11,26,27) × × × ×
proposition(true/false statement) which is
p6 ab′d (18,19,22,23) × ×
true(1) or false(0) value.
❖ Using these Pi variables, a larger Boolean p7 ac′d (18,19,26,27) × × × ×
expression P can be formed, which captures
the precise conditions for every row in the
table to be covered.
EE-223 Digital Logic Design Spring 2024 12
All Possible Solutions using Petrick’s Method
P=(P4+P5)(P1+P3+P4+P5)(P6+P7)(P2+P3+P6+P7)(P5+P7)
(P3+P5+P7)
P=(P4+P5)(P6+P7)(P5+P7) Absorption theorem

P=(P4+P5)(P7+P5P6) + dist over .

P=P4P7 +P4P5P6+P5P7+P5P6
Each product term in the above Boolean expression describes a
solution for the table.
❑ All possible solutions are
f1(a,b,c,d,e)=a′b′e+a′c+b′c+a′bd+ac′d
f1(a,b,c,d,e)=a′b′e+a′c+b′c+bc′d+ac′d
f1(a,b,c,d,e)=a′b′e+a′c+b′c+ab′d+bc′d
EE-223 Digital Logic Design Spring 2024 13
Map Simplification of the Same Function
de
de 00 01 11 10
00 01 11 10
bc bc 1 1
1* 1
00 00
1 1 1 1 1* 1 1 1
01 01

1* 1 1 1
11 11
1 1 1 1
10 10

a=0 a=1

f(a,b,c,d,e)=a′c+b′c+a′b′e+(a′bd+ac′d or bc′d+ab′d or bc′d+ac′d)

EE-223 Digital Logic Design Spring 2024 14

The End

EE-223 Digital Logic Design Spring 2024 15