Scribd
Upload
20 views

Unit 2 - Tabulation Method

Uploaded by

imgautamm121
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Unit 2 - Tabulation Method

Uploaded by

imgautamm121
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Unit 2 (Tabulation

Method)
Quine McCluskey Method (Tabulation Method)

• The quine-McCluskey method also called the tabulation method is a very


useful and convenient method for simplification of the Boolean functions for a
large number of variables (greater than 4).

• This method is useful over K-map when the number of variables is larger for
which K-map formation is difficult.

• This method uses prime implicants for simplification.


• This method includes the use of minterms, and prime implicants and obtains
essential prime implicants which are further used in the simplified boolean
functions.
• Steps for Quine McCluskey Method:
1. Arrange the given minterms according to the number of ones present in their
binary representation in ascending order.
2. Take the minterms from the continuous group if there is only a one-bit
change to make their pair.
3. Place the ‘-‘ symbol where there is a bit change accordingly and keep the
remaining bits the same.
4. Repeat steps 2 to 3 until we get all prime implicants (when all the bits present
in the table are different).
5. Make a prime implicant table that consists of the prime implicants (obtained
minterms) as rows and the given minterms (given in problem) as columns.
6. Place ‘1’ in the minterms (cell) which are covered by each prime implicant.
7. Observe the table, if the minterm is covered by only one prime implicant then
it is an essential to prime implicant.
8. Add the essential prime implicants to the simplified boolean function.
Simplify using tabulation method : F(A,B,C,D) =∑ m(0,1,2,4,6,8,9,11,13,15)

TABLE 1 TABLE-2
Group Minterm A B C D Group Pair A B C D

0 0 0 0 0 0 (0,1) 0 0 0 –
(0,2) 0 0 – 0
0
1 0 0 0 1 (0,4) 0 – 0 0
2 0 0 1 0 (0,8) – 0 0 0
1
4 0 1 0 0
8 1 0 0 0 (1,9) – 0 0 1
(2,6) 0 – 1 0
1
6 0 1 1 0 (4,6) 0 1 – 0
2 (8,9) 1 0 0 –
9 1 0 0 1

11 1 0 1 1 (9,11) 1 0 – 1
3 2
13 1 1 0 1 (9,13) 1 – 0 1

4 15 1 1 1 1 (11,15) 1 – 1 1
3
(13,15) 1 1 – 1
TABLE-3

Group Quad A B C D

(0,1,8,9) – 0 0 –
0
(0,2,4,6) 0 – – 0

1 (9,11,13,15) 1 – – 1

PRIME IMPLICANT TABLE

Minterms ⇢ 0 1 2 4 6 8 9 11 13 15
Prime Implicants ⇣

B’C’ (0,1,8,9) 1 1 1 1

A’D'(0,2,4,6) 1 1 1 1

AD(9,11,13,15) 1 1 1 1

Simplified Boolean function = B’C’ + A’D’ + AD


Thank You

You might also like