Scribd
Upload
66 views2 pages

QuineMcCluskey Error

The document describes the steps of the Quine-McCluskey method to minimize a Boolean function. It shows the prime implicants found in step 1 and selects the essential prime implicants in step 2 to find a minimized expression for the function f.

Uploaded by

nvenkatesh485
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
66 views2 pages

QuineMcCluskey Error

The document describes the steps of the Quine-McCluskey method to minimize a Boolean function. It shows the prime implicants found in step 1 and selects the essential prime implicants in step 2 to find a minimized expression for the function f.

Uploaded by

nvenkatesh485
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/ 2

Quine-McCluskey example - Step 1 - Find prime implicants

f = ˜a˜b˜c˜d + ˜acd + ab˜c + ab˜d + bcd


0000 0-11 110- 11-0 -111

0000 0011 1100 1100 0111


0111 1101 1110 1111

0 0000

3 0011 3, 7 0-11 12,13,14,15 11--


12 1100 12,13 110- (12,14,13,15 11--)
12,14 11-0

7 0111 7,15 -111


13 1101 13,15 11-1
14 1110 14,15 111-

15 1111

prime implicants:
0000 ˜a˜b˜c˜d
0-11 ˜acd
-111 bcd
11-- ab

f = ˜a˜b˜c˜d + ˜acd + bcd + ab

not necessarily minimal


Quine-McCluskey example - Step 2 - Select smallest set of prime implicants

˜a˜b˜c˜d ˜acd bcd ab


0000 0-11 -111 11--
0 3,7 3,15 12,13,14,15

0 X

3 X X

12 X

7 X

13 X

14 X

15 X X

essential prime implicants: ˜a˜b˜c˜d, ˜acd, ab

f = ˜a˜b˜c˜d + ˜acd + ab

You might also like