Scribd
Upload
16 views14 pages

CH 6

Uploaded by

sifbdd
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
16 views14 pages

CH 6

Uploaded by

sifbdd
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/ 14

Digital Logic Circuit

(디지털 논리회로)
Interview
Lecture 6: Quine-McCluskey Method

SungHoon Lim
Department of Electrical Engineering
Jeonbuk National University
Quine-McCluskey Method

Quine-McCluskey Method (퀸-맥클러스키 방법)


✓ Eliminate as many literals as possible from each term by systematically
applying the theorem: XY + XY' = X
✓ Two minterms will combine if they differ in exactly one variable
✓ Example
→

2
Quine-McCluskey Method

Quine-McCluskey Method (퀸-맥클러스키 방법)


✓ In order to find all of the prime implicants, all possible pairs of minterms
should be compared and combined whenever possible
✓ For 4 variables
→ Group 0 has zero 1’s

Group 1 have one 1

Group 2 have two 1’s

Group 3 have three 1’s

→ Two terms can be combined if they differ in exactly one variable


→ Comparison of terms in nonadjacent groups is unnecessary because
such terms will always differ in at least two variables

3
Quine-McCluskey Method

Quine-McCluskey Method (퀸-맥클러스키 방법)


✓ Group 0 and group 1: Terms 0000 and 0001 can be combined to
eliminate the fourth variable, which yields 000–
✓ 0 and 2 combine to form 00–0 (a'b'd'), and 0 and 8 combine to form –
000 (b'c'd’)
✓ Whenever two terms combine, the corresponding decimal numbers
differ by a power of 2

4
Quine-McCluskey Method

Quine-McCluskey Method (퀸-맥클러스키 방법)


✓ Group 1 and group 2: Comparing term 1 with all terms in group 2, we
find that it combines with 5 and 9 but not with 6 or 10
✓ Term may be used more than once because X + X = X
✓ After deleting the duplicate terms, we compare terms from the two
groups in Column III
✓ No further combination is possible, the process terminates

5
Quine-McCluskey Method

Quine-McCluskey Method (퀸-맥클러스키 방법)


✓ The terms which have not been checked off because they cannot be
combined with other terms are called prime implicants
→

✓ Using the consensus theorem to eliminate redundant terms yields


→
✓ Implicant: Function 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.
→ Example:
→ If a'b'c' = 1, then F = 1 (a’b’c’ is implicant of F)
→ If ac = 1, then F = 1 (ac is implicant of F)
→ bc is not an implicant ( a = 0 and b = c = 1, bc = 1 and F = 0)

6
Quine-McCluskey Method

Quine-McCluskey Method (퀸-맥클러스키 방법)


✓ Prime implicant: Prime implicant of a function F is a product term
implicant which is no longer an implicant if any literal is deleted from it

✓ a'b'c' is not a prime implicant because a' can be eliminated, and the
resulting term (b'c') is still an implicant of F
✓ Implicants b'c' and ac are prime implicants because if we delete a literal
from either term, the term will no longer be an implicant of F

7
Prime Implicant Chart

Prime Implicant Chart


✓ Minterms of the function are listed across the top of the chart
✓ Prime implicants are listed down the side
✓ If a prime implicant covers a given minterm, X is placed at the
intersection of the corresponding row and column
✓ If a minterm is covered by only one prime implicant, then that prime
implicant is called an essential prime implicant and must be included
in the minimum sum of products

Prime implicants b'c' and


cd' are essential

8
Prime Implicant Chart

Prime Implicant Chart


✓ Each time a prime implicant is selected for inclusion in the minimum
sum, the corresponding row should be crossed out
✓ The columns which correspond to all minterms covered by that prime
implicant should also be crossed out
✓ A minimum set of prime implicants must now be chosen to cover the
remaining columns
✓ a'bd covers the remaining two columns, so it is chosen to form f

9
Prime Implicant Chart

Prime Implicant Chart


✓ Nonessential prime implicants needed to form the minimum solution
may be selected by trial and error
✓ Example:
Prime implicant chart1 Prime implicant chart2

✓ (0, 1) and (0, 2) cover column 0, so we will try (0, 1)


✓ Next, examine column 2, which is covered by (0, 2) and (2, 6). The
best choice is (2, 6) because it covers two of the remaining columns
✓ (5, 7) covers the remaining columns and completes the solution
✓ Is the final solution minimum size? Final solution:

10
Petrick’s Method

Petrick’s Method
✓ Petrick’s Method: Technique for determining all minimum sum-of-
products solutions from a prime implicant chart
✓ Previous example shows that prime implicant chart has two
minimum solutions
✓ As the number of variables increases, the number of prime
implicants and the complexity of the prime implicant chart may
increase significantly
✓ Petrick’s method is a more systematic way of finding all minimum
solutions from a prime implicant chart

11
Petrick’s Method

Petrick’s Method
✓ logic function, P: True when all of the minterms in the chart have been
covered
✓ P1 be a logic variable which is true when the prime implicant in row P1
is included in the solution
✓ Column 0 has X’s in rows P1 and P2, we must choose row P1 or P2 in
order to cover minterm 0

12
Petrick’s Method

Petrick’s Method
✓ Simplify
✓ Use (X + Y)(X + Z) = X + YZ

✓ Use X + XY = X

✓ In order to cover all of the minterms, we must choose rows P1 and P4


and P5, or rows P1 and P2 and P5 and P6, or . . . or rows P2 and P3 and P6
✓ Although there are five possible solutions, only two of these have the
minimum number of rows (P1P4P5 and P2P3P6)
✓ P1P4P5 = a’b’ + bc’ + ac / P2P3P6 = a’c’ + b’c + ab

13
Simplification of Incompletely Specified Functions

Simplification of Incompletely Specified Functions


✓ Simplify

✓ Don’t-care terms are treated like required minterms when finding the
prime implicants

✓ Don’t-care columns are omitted when forming the prime implicant


chart 1, 10, 15 are omitted

14

You might also like