Unit 6
Quine-McClusky Method
Unit 6 1
Outline
․Determination of prime implicants
․The prime implicant chart
․Petrick’s method
․Simplification of incompletely specified functions
Unit 6 2
Overview (1/2)
․A systematic simplification procedure
․Input: minterm expansion
Output: a minimum sum of products
Step:
1. Generate all prime implicants
Eliminate as many literals as possible from each
term by systematically applying the theorem
XY+XY’=X
2. Find the minimum solution
Use a prime implicant chart to select a minimum
set of prime implicants which contain a minimum
number of literals
Unit 6 3
Overview (2/2)
․Example: F(a,b,c)=a’b’c’+ab’c’+ab’c+abc
All implicants:
a’b’c’, ab’c’, ab’c, abc, ab’, b’c’, ac
Prime implicants:
ab a
ab’, b’c’, ac b’c’
c 00 01 11 10
Essential prime implicants: 0 1 1
b’c’, ac c 1 1 1
ab’
Minimum sum of products: ac
b
F(a,b,c) = b’c’+ac
Unit 6 4
Determination of Prime Implicants (1/5)
․Example: Find all of the prime implicants of the function
f(a,b,c,d)= Σm(0,1,2,5,6,7,8,9,10,14)
Column I Column II Column III
group 0 0 0000 0, 1 000- 0, 1, 8, 9 -00-
1 0001 0, 2 00-0 0, 2, 8, 10 -0-0
group 1 2 0010 0, 8 -000 0, 8, 1, 9 -00-
8 1000 1, 5 0-01 0, 8, 2, 10 -0-0
5 0101 1, 9 -001 2, 6, 10, 14 --10
6 0110 2, 6 0-10 2, 10, 6, 14 --10
group 2
9 1001 2, 10 -010
10 1010 8, 9 100-
7 0111 8, 10 10-0
group 3
14 1110 5, 7 01-1
6, 7 011-
6, 14 -110
10, 14 1-10
Unit 6 5
Determination of Prime Implicants (2/5)
Column I Column II Column III
group 0 0 0000 √ 0, 1 000- √ 0, 1, 8, 9 -00- P4
1 0001 √ 0, 2 00-0 √ 0, 2, 8, 10 -0-0 P5
group 1 2 0010 √ 0, 8 -000 √ 0, 8, 1, 9 -00-
8 1000 √ 1, 5 0-01 P1 0, 8, 2, 10 -0-0
5 0101 √ 1, 9 -001 √ 2, 6, 10, 14 --10 P6
6 0110 √ 2, 6 0-10 √ 2, 10, 6, 14 --10
group 2
9 1001 √ 2, 10 -010 √
10 1010 √ 8, 9 100- √ All of the prime implicants:
7 0111 √ 8, 10 10-0 √ P1 = {1,5} = 0-01 = a’c’d
group 3
14 1110 √ 5, 7 01-1 P2 P2 = {5,7} = 01-1 = a’bd
6, 7 011- P3 P3 = {6,7} = 011- = a’bc
P4 = {0,1,8,9} = -00- = b’c’
6, 14 -110 √ P5 = {0,2,8,10} = -0-0 = b’d’
10, 14 1-10 √ P6 = {2,6,10,14} = --10 = cd’
Unit 6 6
Determination of Prime Implicants (3/5)
․Find all of the prime implicants
(1) Represent each minterm by a binary code
(2) Find the decimal number for each binary code
(3) Define the number of 1’s in binary number as the index of the
number.
(3-1) Group all the binary numbers of the same index into a
group
(3-2) List all the groups in a column in the index ascending order
(3-3) Within each group, the binary number are listed in the
ascending order of their decimal-number equivalent
Unit 6 7
Determination of Prime Implicants (4/5)
(4) Start with the terms in the set of lowest index; compare them with
those, if any, in the set whose index is 1 greater, and eliminate all
redundant variables by XY+XY’=X
(5) Check off all the terms that entered into the combinations. The
ones that are left are prime implicants
(6) Repeat step (4) and (5) until no further reduction is possible
Unit 6 8
Determination of Prime Implicants (5/5)
f = a’c’d + a’bd + a’bc + cd’ + b’d’ + b’c’
(1, 5) (5, 7) (6, 7) (2, 6, 10, 14) (0, 2, 8, 10) (0, 1, 8, 9)
P1 P2 P3 P4 P5 P6
Minimum form ???
f = a’bd + cd’ + b’c’
Unit 6 9
The Prime Implicant Chart (1/7)
․Example:
Prime Implicant Table
0 1 2 5 6 7 8 9 10 14
(0, 1, 8, 9) b’c’ P6
(0, 2, 8, 10) b’d’ P5
(2, 6, 10, 14) cd’ P4
(1, 5) a’c’d P1
(5, 7) a’bd P2
(6, 7) a’bc P3
Unit 6 10
The Prime Implicant Chart (2/7)
Prime Implicant Table
0 1 2 5 6 7 8 9 10 14
(0, 1, 8, 9)* b’c’ P6*
(0, 2, 8, 10) b’d’ P5
(2, 6, 10, 14)* cd’ P4*
(1, 5) a’c’d P1
(5, 7) a’bd P2
(6, 7) a’bc P3
No secondary essential term.
5 7
(1, 5) a’c’d P1 Include the essential prime implicants
(5, 7) a’bd P2 in the minimal sum;
(6, 7) a’bc P3 The minimal sum is:
f(a,b,c,d)=b’c’+cd’+a’bd
Unit 6 11
The Prime Implicant Chart (3/7)
․Construct the Prime Implicant Table (Chart) and find the
Essential Prime Implicants of the function
(1) Construct the prime implicant table
(1-1) Each column carries a decimal number at the top
which correspond to the one of the minterm in the
given function
(1-2) The column are assigned by such a number in
ascending order
(1-3) Each row corresponds to one of the prime
implicants, P1, P2, …
Unit 6 12
The Prime Implicant Chart (4/7)
(2) Make a cross under each decimal number that is a term
contained in the prime implicant represented by that row
(3) Find all the columns that contain a single cross and
circle them; place an asterisk * at the left of those rows in
which you circle a cross
The rows marked with an asterisk are the essential
prime implicants
Unit 6 13
The Prime Implicant Chart (5/7)
․Example with a cyclic prime implicant table
Sol: Find all of the prime implicants
F= Σ m(0,1,2,5,6,7)
0 000 √ 0, 1 00- P1
ab a
1 001 √ 0, 2 0-0 P2 c
1 1 1
2 010 √ 1, 5 -01 P3
c 1 1 1
5 101 √ 2, 6 -10 P4
6 110 √ 5, 7 1-1 P5 b
7 111 √ 6, 7 11- P6
Unit 6 14
The Prime Implicant Chart (6/7)
Select P1 first
0 1 2 5 6 7
(0, 1) a’b’ P1
(0, 2) a’c’ P2
(1, 5) b’c P3
(2, 6) bc’ P4
(5, 7) ac P5
(6, 7) ab P6
The minimum sum of products F=a’b’+bc’+ac
Unit 6 15
The Prime Implicant Chart (7/7)
Select P2 first
0 1 2 5 6 7
(0, 1) a’b’ P1
(0, 2) a’c’ P2
(1, 5) b’c P3
(2, 6) bc’ P4
(5, 7) ac P5
(6, 7) ab P6
The minimum sum of products F=a’c’+b’c+ab
The minimum sum of product is not unique
Unit 6 16
Petrick’s Method (1/6)
․A technique for determining all minimum sum-of-products
solutions from a prime implicant table
․Before applying Petrick’s method, all essential prime
implicants and minterms they cover should be removed from
the table
Unit 6 17
Petrick’s Method (2/6)
․Example: F=Σm(0,1,2,5,6,7)
0 1 2 5 6 7
P1 (0, 1) a’b’
P2 (0, 2) a’c’
P3 (1, 5) b’c
P4 (2, 6) bc’
P5 (5, 7) ac
P6 (6, 7) ab
Unit 6 18
Petrick’s Method (3/6)
․In order to cover minterm 0, we must choose P1 or P2
the expression P1+P2 must be true
cover 0 P1+P2
1 P1+P3
2 P2+P4
5 P3+P5
6 P4+P6
7 P5+P6
Unit 6 19
Petrick’s Method (4/6)
Using (X+Y)(X+Z)=X+YZ and the distributive law
P=(P1+P2)(P1+P3)(P2+P4)(P3+P5)(P4+P6)(P5+P6) = 1
P = (P1+P2P3) (P4+P2P6) (P5+P3P6)
= (P1P4+P1P2P6+P2P3P4+P2P3P6) (P5+P3P6)
= P1P4P5+ P1P2P5P6+ P2P3P4P5+P2P3P5P6+P1P3P4P6
+ P1P2P3P6+ P2P3P4P6+ P2P3P6
Unit 6 20
Petrick’s Method (5/6)
Use X XY X to delete redundant terms from P
P = P1P4P5+P1P2P5P6+P2P3P4P5+P2P3P5P6
+P1P3P4P6+P1P2P3P6+P2P3P4P6+P2P3P6
= P1P4P5+ P1P2P5P6+ P2P3P4P5+P1P3P4P6+P2P3P6
3 implicants 4 4 4 3
Two minimum solutions:
F = P1+P4+P5 = a’b’+bc’+ac
F = P2+P3+P6 = a’c’+b’c+ab
Unit 6 21
Petrick’s Method (6/6)
․Petrick’s Method
1. Label the rows of the table, P1, P2, …
2. Form a logic function P(P1,P2,…), which is true when
all of the minterms in the table have been covered
3. Reduce P to a minimum sum of products using
(X+Y)(X+Z)=X+YZ and X+XY=X
4. Select one solution that has minimum number of prime
implicant, minimum number of literals
Unit 6 22
Simplification of Incompletely Specified Functions (1/3)
․Modify the Quine-McCluskey procedure
Finding the Prime Implicants
Treat the don’t care terms as if they were required
minterms
Forming the Prime Implicant Table
The don’t cares are not listed at the top of the table
Unit 6 23
Simplification of Incompletely Specified Functions (2/3)
․Example: Simplify F(A,B,C,D)= Σm(2,3,7,9,11,13)+Σd(1,10,15)
Sol: Treat the don’t cares (1, 10, 15) as required minterms
1 0001 √ (1, 3) 00-1 √ (1, 3, 9, 11) -0-1
2 0010 √ (1, 9) -001 √ (2, 3, 10, 11) -01-
3 0011 √ (2, 3) 001- √ (3, 7, 11, 15) --11
9 1001 √ (2, 10) -010 √ (9, 11, 13, 15) 1--1
10 1010 √ (3, 7) 0-11 √
7 0111 √ (3, 11) -011 √
11 1011 √ (9, 11) 10-1 √
13 1101 √ (9, 13) 1-01 √
15 1111 √ (10, 11) 101- √
(7, 15) -111 √
(11, 15) 1-11 √
(13, 15) 11-1 √
Unit 6 24
Simplification of Incompletely Specified Functions (3/3)
․The don’t cares are not listed at the top of the table
2 3 7 9 11 13
(1, 3, 9, 11)
*(2, 3, 10, 11) F=B’C+CD+AD
*(3, 7, 11, 15)
*(9, 11, 13, 15)
*essential prime implicants
Unit 6 25
