Scribd
Upload
27 views20 pages

6tabulation Method

The Quine-McCluskey Method, also known as the Tabulation Method, is a systematic approach for minimizing Boolean functions, particularly useful for functions with more than five variables and multiple outputs. It involves constructing an Implicant Table, a Covering Table, and identifying Essential Prime Implicants to derive a simplified logic expression. This method addresses the limitations of Karnaugh maps, such as subjectivity and implementation challenges on computers.

Uploaded by

rc
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
27 views20 pages

6tabulation Method

The Quine-McCluskey Method, also known as the Tabulation Method, is a systematic approach for minimizing Boolean functions, particularly useful for functions with more than five variables and multiple outputs. It involves constructing an Implicant Table, a Covering Table, and identifying Essential Prime Implicants to derive a simplified logic expression. This method addresses the limitations of Karnaugh maps, such as subjectivity and implementation challenges on computers.

Uploaded by

rc
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/ 20

Quine-McCluskey Method

(or)
Tabulation Method

1
Quine-McCluskey Minimization
⬥ wrt to minimization, K-maps Only good for:
■ Small functions (<5variables)
■ Single output function at a time
⬥ Not Implementable on Computer
⬥ Subjective Interpretation, Different
Coverings
⬥ Q-M (Tabular Minimization) Solves These
Problems
Basic Definitions
⬥ Prime Implicant
■ A group of adjacent 1’s that is not contained
within any larger implicant
⬥ Essential Prime Implicant
■ A prime implicant which includes a minterm that
is covered by only one Prime Implicant

3
Basic Definitions
⬥ Complete Sum
■ A representation of a function by the sum of
ALL possible prime implicants
■ Not necessarily irredundant
⬥ Irredundant Sum
■ The representation of a function by A sum of PIs
such that the removal of any one of the PIs
changes the value of the function for some
combination of input values
Basic Definitions
⬥ Cost Function
■ A measure of the effort or hardware associated
with the implementation of something or the
accomplishment of a task
⬥ Digital Design Cost Functions
■ Number of terms
■ Number of occurrences of a literal (not the
number of distinct literals).
Quine-McCluskey Method
1. Construct the Implicant Table
a) Group minterms by number of 1’s
b) Apply Adjacency Theorem to pairs of
implicants
c) Mark all implicants that are used in larger
groups
Q-M Example*
Step 1a: Implicant Table
Size Minterms

0
0

2
1 8

3
2 5
10
7
3
13
4 15
Step 1b,c: Adjacency Theorem
Size Minterms One-Cube

✔0 0,2 (2)
0
0,8 (8)
✔2
1 ✔8

3
2 5
10
7
3
13
4 15
Step 1b,c: Adjacency Theorem
Size Minterms One-Cube

✔0 (00-0) 0,2
0
(-000) 0,8
✔2 (001-) 2,3
1 ✔8 (-010) 2,10
(10-0) 8,10
✔3 (0-11) 3,7
2 ✔5 (01-1) 5,7
✔10 (-101) 5,13
✔7 (-111)7,15
3
✔13 (11-1)13,15
4 ✔15
Step 1b,c: Adjacency Theorem
Size Minterms One-Cube Two-Cube

✔0 ✔0,2
0 0,2,8,10 (-0-0)
✔0,8
✔2 2,3
1 ✔8 ✔2,10
✔8,10
✔3 3,7
2 ✔5 ✔5,7 5,7,13,15 (-1-1)
✔10 ✔5,13
✔7 ✔7,15
3
✔13 ✔13,15
4 ✔15
Quine-McCluskey Method
2. Construct the Covering Table
a) Prime Implicants and Minterms
b) Mark rows and columns
c) Identify Essential Prime Implicants
3. Construct the Reduced Covering Table
a) Secondary Prime Implicants
b) Mark rows and columns
c) Minimum cover for remaining minterms
4. Simplified Logic Expression
Step 2a: Covering Table

Prime Minterms
Implicants 0 2 3 5 7 8 10 13 15
●0,2,8,10
●5,7,13,15
2,3
3,7
Step 2b: Covering Table

Prime Minterms
Implicants 0 2 3 5 7 8 10 13 15
●0,2,8,10 (2,8) X X X X
●5,7,13,15 (2,8) X X X X
2,3 (1) X X
3,7 (4) X X
2c: Essential Prime Implicants

Prime Minterms
Implicants 0 2 3 5 7 8 10 13 15
★0,2,8,10 (2,8) X X X X
★5,7,13,15 (2,8) X X X X
2,3 (1) X X
3,7 (4) X X
Step 2c: Covering Table

Prime √ √ √ √ √ √ √ √
Implicants 0 2 3 5 7 8 10 13 15
★0,2,8,10 (2,8) X X X X
★5,7,13,15 (2,8) X X X X
2,3 (1) X X
3,7 (4) X X
3a,b: Reduced Covering Table

Prime Minterms
Implicants 3

2,3 (1) X
3,7 (4) X
3c: Reduced Covering Table

Prime Minterms
Implicants 3

2,3 (1) X
3,7 (4) X
4: Simplified Logic Expression
Summary
⬥ Q-M
⬥ Implicant Table
⬥ Covering Table
⬥ Essential Prime Implicants
⬥ Simplified Logic Expression

You might also like