Scribd
Upload
143 views13 pages

QM Method

The document describes the Quine-McCluskey (QM) method for minimizing Boolean functions. The QM method involves finding prime implicants, essential prime implicants, and covering the minterms with the minimum number of prime implicants. An example application of the QM method is shown step-by-step to minimize a Boolean function.

Uploaded by

Bhaskar Lal Das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPSX, PDF, TXT or read online on Scribd
143 views13 pages

QM Method

The document describes the Quine-McCluskey (QM) method for minimizing Boolean functions. The QM method involves finding prime implicants, essential prime implicants, and covering the minterms with the minimum number of prime implicants. An example application of the QM method is shown step-by-step to minimize a Boolean function.

Uploaded by

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

Digital Logic Design

1. M. Morris Mano, “Digital Logic Design”, Prentice Hall, 2018.


2. Anand Kumar, “Fundamentals of Digital Circuits”, Prentice Hall, 2014.
3. R. P. Jain, “Modern Digital Electronics”, Tata McGraw Hill, 2009.
Quine-McCluskey Method

• Procedure
– Find all the prime implicants
– Find essential prime implicants
– Find minimum number of prime implicants required to cover all
the minterms
QM Methods – basic idea

• Basic principle of minimization


– XY + XY’ = X
• Finding prime implicants phase
– Compare every pair of minterms
• Combine a pair if only one variable differ
• Reduce comparison by grouping
• Remove redundant pair, if any
– Repeat the process for the new stage till no more stage can be
created
• Covering phase
QM method (example)

• F(a,b,c,d) = ∑ m(0,1,2,5,6,7,8,9,10,14)
– 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
• 14 1110
Prime implicant table
Stage 1
0 0000
1 0001
2 0010
8 1000
5 0101
6 0110
9 1001
10 1010
7 0111
14 1110
Prime implicant table
Stage 1 Stage 2
0 0000 0,1 000-
1 0001 0,2 00-0
2 0010 0,8 -000
8 1000 1,5 0-01
5 0101 1,9 -001
6 0110 2,6 0-10
9 1001 2,10 -010
10 1010 8,9 100-
7 0111 8,10 10-0
14 1110 5,7 01-1
6,7 011-
6,14 -110
10,14 1-10
Prime implicant table
Stage 1 Stage 2 Stage 3
0 0000 √ 0,1 000- √ 0,1,8,9 -00- B’C’
1 0001 √ 0,2 00-0 √ 0,2,8,10 -0-0 B’D’
2 0010 √ 0,8 -000 √ 0,8,1,9 -00-
8 1000 √ 1,5 0-01 A’C’D 0,8,2,10 -0-0
5 0101 √ 1,9 -001 √ 2,6,10,14 --10 CD’
6 0110 √ 2,6 0-10 √ 2,10,6,14 --10
9 1001 √ 2,10 -010 √
10 1010 √ 8,9 100- √
7 0111 √ 8,10 10-0 √
14 1110 √ 5,7 01-1 A’BD
6,7 011- A’BC
6,14 -110 √
10,14 1-10 √
Prime implicant chart
Prime implicant 0 1 2 5 6 7 8 9 10 14
0,1,8,9 B’C’ X X X X
0,2,8,10 B’D’ X X X X
2,6,10,14 CD’ X X X X
1,5 A’C’D X X
5,7 A’BD X X
6,7 A’BC X X

F = B’C’ + CD’ + A’BD


Cyclic dependencies

• F(a,b,c) = ∑ m(0,1,2,5,6,7)
0 1 2 5 6 7
P1 0,1 A’B’ X X
P2 0,2 A’C’ X X
P3 1,5 B’C X X
P4 2,6 BC’ X X
P5 5,7 AC X X
P6 6,7 AB X X

F = A’B’ + BC’ + AC
Cyclic dependencies – 2nd Solution

• F(a,b,c) = ∑ m(0,1,2,5,6,7)
0 1 2 5 6 7
P1 0,1 A’B’ X X
P2 0,2 A’C’ X X
P3 1,5 B’C X X
P4 2,6 BC’ X X
P5 5,7 AC X X
P6 6,7 AB X X
F = A’C’ + BC’ + AB
Incompletely specified function

• Don’t care terms are treated like regular terms while


finding prime implicants
• Don’t care terms are not included in prime implicant
chart
– They don’t contribute to essential prime implicant
• Example
– F(a,b,c,d) = ∑ m(0,1,2,8,9,10,14) + ∑ d(5,6,7)
Prime implicant chart
Prime implicant 0 1 2 8 9 10 14
0,1,8,9 B’C’ X X X X
0,2,8,10 B’D’ X X X X
2,6,10,14 CD’ X X X
1,5 A’C’D X
5,7 A’BD
6,7 A’BC

F = B’C’ + CD’
Summary

• Observations
– QM method can be used in automation
– More systematic method for two level minimizations
– Underline approach is same, can be used interchangeably
digital minimization

You might also like