Scribd
Upload
47 views

Reference For Ece320: Quine-Mccluskey'S Method

Quine-McCluskey's method is a brute-force technique for minimizing Boolean functions. It involves grouping minterms based on the number of 1s, comparing adjacent groups to find prime implicants, then constructing a cover table to determine a minimum cover of prime implicants that represents the original function.

Uploaded by

Aviral Agarwal
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
47 views

Reference For Ece320: Quine-Mccluskey'S Method

Quine-McCluskey's method is a brute-force technique for minimizing Boolean functions. It involves grouping minterms based on the number of 1s, comparing adjacent groups to find prime implicants, then constructing a cover table to determine a minimum cover of prime implicants that represents the original function.

Uploaded by

Aviral Agarwal
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Reference for ECE320: Quine-McCluskey's Method

Quine-McCluskey's Method This is a brute-force method finding the prime implicants. From the K-map, Minterms are gathered into groups according to the number of 1s in the binary representation of minterms, which are then exhaustively compared to one another. This step yields all of the prime implicants (PIs). These PIs are then placed into a table format, where the minimal number of PIs necessary to retain the original function are found. This is done by eliminating the redundant PI's. Note that the numbers inside the parentheses indicates the decimal equivalent of the corresponding Minterm/Maxterms as they are numbered in the K-map. The steps of the method are shown in relation to the following example:

A 0 0 0 0 1 1 1 1 1

B 0 0 1 1 0 0 1 1 1

C 1 1 0 1 0 1 0 0 1

D 0 1 1 1 0 0 0 1 1

2 3 5 7 8 10 12 13 15

The truth table above shows only the Minterms. The above map can then be represented in function form as f(A, B, C, D) = (2,3,5,7,8,10,12,13,15) = (0,1,4,6,9,11,14) : Summation : Product

Quinne-McCluskey's Method: Step 1. Group Minterms according to the number of ones they contain. (For example, the Minterm 1101, corresponding to square 13, contains 3 ones.)

Group # 1 0010 1000 2 0011 0101 1010 1100 3 0111 1101 4 1111 (2) (8) (3) (5) (10) (12) (7) (13) (15)

Step 2. Recall that ABCD + ABCD = ABD(C + C) = ABD Using this knowledge, compare all pairs of terms in adjacent groups, looking for a change in one and only one position. Create new groups from the composite terms obtained, if any and replace the position in which any 2 terms disagree with a dash (-). Looking at the first entry (2,3) we can see that minterm 2 and minterm 3 agree in three of the four possible places. There is only one disagreement, however -- the rightmost digit. We therefore place a dash in this position. Notice that in this step we only compare members of adjacent groups; obviously, members of non-adjacent groups differ in more than two places by definition. Every time a member of a group is combined with any other member of a different group, they both are eliminated from the list of implicants to be considered later. At the termination of step 3 only the prime implicants (not contained in any larger size implicants) remain. Therefore, the purpose of Quinne-McCluskey's method is to generate the list of prime implicants for a given function.

G roup 1 Against 2 (First New G roup) 001-010 10-1 1-00 (2,3) (2,10) (8,10) (8,12)

G roup # 1 0010 1000 (2) (8) (3) (5) (10) (12) (7) (13) (15)

G roup 2 Against 3 (Second New G roup) #2 in not reducible 0-11 01-1 -101 110(3,7) (5,7) (5,13) (12,13)

0011 0101 1010 1100

0111 1101

1111

G roup 3 Against 4 (Third New G roup) -111 11-1 (7,15) (13,15)

Step 3. Now, repeat the above step comparing all terms in the new 1st group against all terms in the new 2nd group, etc. Continue this until no more reduction can be obtained. In this step, we again compare adjacent groups. The result from this step is that all members of all groups contain two dashes. from 2nd with 3rd new groups, we get these terms, - 1 - 1 (5,7,13,15) - 1 - 1 (5,13,7,15) The following results are obtained; (2,3) (2,10) (8,10) (8,12) (3,7)

(12,13) (5,7,13,15) these are the PRIME IMPLICANTS. Note: We only need to exhaustively compare all terms of any 2 consecutive groups. (Why?) Now generate a "Cover Table". Minterms 2 3 5 P.Is X X 2,3 X 2,10 8,10 8,12 X 3,7 12,13 X 5,7,13,15 7 8 10 12 13 15

X X X

X X X X X X

Now to find a "Minimum Cover Table",use the following procedure: 1. Eliminate all identical rows except for one of them. 2. If any COLUMN contains only one X, then the associated ROW (P.I.) is ESSENTIAL and must be in our final selection. Eliminate this row and the columns it covers. 3. If any ROW dominates any other ROW, then the dominated row is eliminated. (we should not see that in this example as there are only PIs in the column at the left) 4. If any COLUMN dominates any other COLUMN, then the dominating column is eliminated!! (this is trying to minimize the redundant terms). After step 2 above, our table looks as follows (here we have no repetition of rows): Minterms P.Is 2,3 2,10 8,10 8,12 3,7 12 2 X X 3 X X X X X X X X 8 10 12

Visual inspection could yield the following covers; (2,3) (8,10) (12,13) or (2,3) (2,10) (8,12) The minimal PI's for cover are then added to the essential PI's to form the complete cover.

You might also like