Scribd
Upload
44 views10 pages

Unit 2 - Tabulation Method

The document describes the Tabulation method, also known as the Quine-McCluskey method, for simplifying Boolean functions with five or more variables. It cannot be done with Karnaugh maps. The method involves arranging the minterms based on number of 1s, comparing adjacent terms and marking similarities, continuing this process until no further reductions can be made, then listing the prime implicants. An example problem is given to demonstrate the method.

Uploaded by

Ibrahim Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
44 views10 pages

Unit 2 - Tabulation Method

The document describes the Tabulation method, also known as the Quine-McCluskey method, for simplifying Boolean functions with five or more variables. It cannot be done with Karnaugh maps. The method involves arranging the minterms based on number of 1s, comparing adjacent terms and marking similarities, continuing this process until no further reductions can be made, then listing the prime implicants. An example problem is given to demonstrate the method.

Uploaded by

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

Tabulation method

Tabulation method (or) The Quine-McCluskey Method

• For Boolean functions up to four variables, the Karnaugh map method is


a powerful minimization method.
• When there are five variables, the Karnaugh map method is difficult to
apply and completely impractical beyond five.
• The Quine-McCluskey method is a formal tabular method for applying
the Boolean distributive law to various terms to find the minimum sum
of products
Procedure for simplification of Boolean function by Quine-McCluskey method

• Each minterm should be expressed by its binary representation.


• Arrange the minterms based on the number of 1’s.
• Compare each binary number from one group to other and if they differ only one bit
position, put dash(-) mark and copy the remaining term. Please tick mark after each
comparison.
• Apply the same process described in step 3 for the resultant columns and this cycle
has to be continued until no new list can be found (i.e., no further elimination of
literals)
• List the unchecked (unticked) implicant and form prime implicant chart.
Example
• Simplify the given Boolean function by tabulation method.

• Solution:
• Minterms are m1, m3,m4,m5,m10, m12,m13,m15.

You might also like