Scribd
Upload
104 views13 pages

Quine MC Cluskey Method

The Quine-McCluskey method is a systematic procedure to minimize a sum of products expression by: 1. Eliminating literals between terms to find prime implicants. 2. Sorting the prime implicants into groups to reduce comparisons. 3. Comparing adjacent groups and combining terms that differ by one literal. The remaining prime implicants that cannot be combined are used to find the minimum sum of products expression for the function.

Uploaded by

Mourya J p
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
104 views13 pages

Quine MC Cluskey Method

The Quine-McCluskey method is a systematic procedure to minimize a sum of products expression by: 1. Eliminating literals between terms to find prime implicants. 2. Sorting the prime implicants into groups to reduce comparisons. 3. Comparing adjacent groups and combining terms that differ by one literal. The remaining prime implicants that cannot be combined are used to find the minimum sum of products expression for the function.

Uploaded by

Mourya J p
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Quine-McCluskey Method

• A systematic simplification
procedure to reduce a minterm
expansion to a minimum sum of
products.
• Use XY + XY’ = X to eliminate
as many as literals as possible.
– The resulting terms = prime
implicants.
• Use a prime implicant chart to
select a minimum set of prime
implicants.

Chap 6 C-H 1
Determination of Prime
Implicants

√ Eliminate literals
Two terms can be combined if they
differ in exactly one variable.
AB’CD’ + AB’CD = AB’C
10 10 +1011 = 101
X Y X Y’ X

A’BC’D + A’BCD’ (won’t combine)


0 1 0 1 + 0 1 1 0 (check # of 1’s)

We need to compare and combine


whenever possible.

Chap 6 C-H 2
Sorting to Reduce
Comparisons
√ Sort into groups according to
the number of 1’s.
F(a,b,c.d) = Σm(0,1,2,5,6,7,8,9,10,14)
• No need for comparisons
– (1) Terms in nonadjacent group
– (2) Terms in the same group
Group 0 0 0000

Group 1 1 0001
2 0010
8 1000

Group 2 5 0101
6 0110
9 1001
10 1010

Group 3 7 0111 Chap 6 C-H 3


14 1110
Comparison of adjacent
groups
– Use X + X = X repeatedly between adjacent
groups
– Those combined are checked off.
– Combine terms that have the same dashes and
differ one in the number of 1’s. (for column II and
column III)

Chap 6 C-H 4
Prime Implicants
• The terms that have not been
checked off are called prime
implicants.
f = 0-01 + 01-1+011- + -00-
+ -0-0 + --10
= a’c’d + a’bd + a’bc + b’c’ +
b’d’ + cd’
• Each term has a minimum number of
literals, but minimum SOP for f:
f = a’bd + b’c’ + cd’
(a’bd, cd’ => a’bc)
(a’bd, b’c’ => a’c’d)
(b’c’, cd’ => b’d’)

Chap 6 C-H 5
Definition of Implicant
– Definition
• Given a function of F of n variables,
a product term P is an implicant of F
iff for every combination of values
of the n variables for which P = 1, F
is also equal to 1.
– Every minterm of F is an implicant of
F.
– Any term formed by combining two or
more minterms is an implicant.
– If F is written in SOP form, every
product term is an implicant.
– Example: f(a,b,c) = a’b’c’ + ab’c’
+ ab’c + abc = b’c’ + ac
– If a’b’c’ = 1, then F = 1, if ac = 1, then
F = 1. a’b’c’ and ac are implicants.
– If bc = 1, (but a = 0), F = 0, so bc is not
an implicant of F.

Chap 6 C-H 6
Definition of Prime Implicant
– Definition
• A prime implicant of a function F is
a product term implicant which is no
longer an implicant if any literal is
deleted from it.
• Example: f(a,b,c) = a’b’c’ + ab’c’ +
ab’c + abc = b’c’ + ac
– Implicant a’b’c’ is not a prime
implicant. Why? If a’ is deleted, b’c’ is
still an implicant of F.
– b’c’ and ac are prime implicants.
• Each prime implicant of a function
has a minimum number of literals
that no more literals can be
eliminated from it or by combining
it with other terms.

Chap 6 C-H 7
Quine McClusky
Procedure
• QM procedure:
– Find all product term implicants
of a function
– Combine non-prime implicants.
• Remaining terms are prime
implicants.
– A minimum SOP expression consists of
a sum of some (not necessarily all) of
the prime implicants of that function.
• We need to select a minimum set of prime
implicants.
– If an SOP expression contains a term
which is not a prime implicant, the SOP
cannot be minimum.

Chap 6 C-H 8
Prime Implicant Chart

• Chart layout
– Top row lists minterms of the function
– All prime implicants are listed on the left side.
– Place x into the chart according to the minterms that
form the corresponding prime implicant.
• Essential prime implicant
– If a minterm is covered only by one prime implicant,
that prime implicant is called essential prime
implicant. (9 & 14).
» Essential prime implicant must be included in
the minimum sum of the function.

Chap 6 C-H 9
Selection of Prime
Implicants
√ Cross out the row of the selected essential
prime implicants
√ The columns which correspond to the
minterms covered by the selected prime
implicants are also crossed out.
√ Select a prime implicant that covers the
remaining columns. This prime implicant is
not essential.

Chap 6 C-H 10
A Cyclic Prime Implicant
Chart
• Two or more X’s in every column.
• F = Σm(0,1,2,5,6,7)
– F = a’b’ + bc’ + ac. (by try and error). No
guarantee for this to be minimum.

0 000 All checked 0,1 00-


1 001 off 0,2 0-0
2 010 1,5 -01
5 101 2,6 -10
6 110 5,7 1-1
7 111 6,7 11-

Chap 6 C-H 11
Another Solution

• F = a’c’ + b’c + ab
• Each minterm is covered by two
different prime implicants.

Chap 6 C-H 12
Simplification of Incompletely
Specified Functions
• An incompletely specified function

Chap 6 C-H 13

You might also like