Scribd
Upload
4 views10 pages

Lecture 19

Lecture 19 discusses the tabular method for minimizing Boolean functions, particularly suitable for larger functions beyond the capabilities of Karnaugh maps. The Quine-McCluskey method is introduced, emphasizing the systematic approach to identify prime implicants through combining terms that differ by a single literal. The lecture concludes with the need to select a minimal set of prime implicants that cover all true minterms of the function.

Uploaded by

Mohd Anas
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
4 views10 pages

Lecture 19

Lecture 19 discusses the tabular method for minimizing Boolean functions, particularly suitable for larger functions beyond the capabilities of Karnaugh maps. The Quine-McCluskey method is introduced, emphasizing the systematic approach to identify prime implicants through combining terms that differ by a single literal. The lecture concludes with the need to select a minimal set of prime implicants that cover all true minterms of the function.

Uploaded by

Mohd Anas
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/ 10

Lecture 19: Minimization using Tabular Method (Part 1)

PROF. INDRANIL SENGUPTA


DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Introduction
• The Karnaugh map method of minimization can be used only for functions with
up to 5 or 6 variables.
– Also, difficult to automate on computer.
• For larger functions, a more systematic procedure is required.
– We can use Quine‐McCluskey method (also known as tabular method).
– Suitable for hand computation and can also be automated easily.
• Basic concept remains the same.
– Repeated application of the theorem: A.x + A.x’ = A to all adjacent pair of terms.
– Yields the set of all prime implicants at the end.

Switching Circuits & Logic Design 2


• An example illustrated:
F (A,B,C,D) = A’B’C’D’ + A’B’C’D + AB’C’D’ + AB’C’D
• Combining first two and last two terms, we get
F = A’B’C’ (D + D’) + AB’C’ (D + D’) = A’B’C’ + AB’C’
• Now combining the resulting product terms, we get
F = B’C’ (A + A’) = B’C’
• We get the prime implicant B’C’
• Basically, we can go on combining any pair of product terms that differ in the
value of a single literal.

Switching Circuits & Logic Design 3


The Basic Concept
• Two k‐variable terms can be combined into a single (k‐1)‐variable term, if and
only if they differ in only one literal.
– We use the binary representation of the minterms for convenience.
– Two minterms can be combined if their binary representations differ in only one
position.
– We use the symbol ‘‐’ to indicate the absence of a literal.
• An example:
– A’B’C’D denoted by 0001, AB’C’D denoted by 1001.
– After combining, we get ‐001.

Switching Circuits & Logic Design 4


The Tabular Method :: Identify all Prime Implicants
1. Arrange all the minterms in groups, based on the number of 1’s.
– The number of 1’s in a term is called the index.
2. Compare every term of index i with each term in the group with index (i+1).
– Where possible, merge them using the rule: A.x + A.x’ = A.
– Place a check mark next to every term that has been combined with at least one term.
3. Now compare the terms generated in Step‐2 in the same fashion; generate a
new term by combining two terms that differ by only a single 1 and whose
dashes are in the same position.
– The process continues until no further combinations are possible.
– The remaining unchecked terms are the prime implicants of the function.

Switching Circuits & Logic Design 5


Example 1: F (w,x,y,z) =  (0, 1, 2, 5, 7, 8, 9, 10, 13, 15)
Step (i) Step (ii) Step (iii)
w x y z w x y z w x y z
0 0 0 0 0 0,1 0 0 0 -- 0,1,8,9 -- 0 0 -- A
1 0 0 0 1 0,2 0 0 -- 0 0,2,8,10 -- 0 -- 0 B
2 0 0 1 0 0,8 -- 0 0 0 1,5,9,13 -- -- 0 1 C
8 1 0 0 0 1,5 0 -- 0 1 5,7,13,15 -- 1 -- 1 D
5 0 1 0 1 1,9 -- 0 0 1
9 1 0 0 1 2,10 -- 0 1 0
10 1 0 1 0 8,9 1 0 0 --
7 0 1 1 1 8,10 1 0 -- 0
The set of prime implicants are:
13 1 1 0 1 5,7 0 1 -- 1 {x’y’, x’z’, y’z, xz}
15 1 1 1 1 5,13 -- 1 0 1
9,13 1 -- 0 1
7,15 -- 1 1 1
13,15 1 1 -- 1

Switching Circuits & Logic Design 6


Example 2: F (A,B,C,D) =  (1, 2, 4, 8, 10, 14, 15)

Switching Circuits & Logic Design 7


Example 3: F (A,B,C,D) =  (0, 3, 5, 8, 10, 13) + φ (2, 7, 11)

Switching Circuits & Logic Design 8


The Next Step
• What we have obtained?
– Set of all prime implicants of the function.
– Some are essential, while some are non‐essential.
• What do we need to do now?
– Select a minimal set of prime implicants that covers all the true minterms of the
function.
– Of course, the essential prime implicants must be selected.
• We shall discuss a tabular method of minimization.

Switching Circuits & Logic Design 9


END OF LECTURE 19

Switching Circuits & Logic Design 10

You might also like