Digital Logic and System Design

(CSE 1823)
Unit- II
Minimization Techniques
Lecture- 3
The Tabulation Method

Dr. Md. Shafiqul Islam

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-1
 Outline of Unit- II (Lecture- 3)

 The Tabulation Method

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-2
 The Tabulation Method
 K-Map Pros and Cons
 K-Map is systemic
 Require the ability to identify and visualize the prime implicants in order
to cover all minterms
 But effective only up to 5-6 input variables!
 The Tabulation Method
 Also known as Quine-McCluskey Method
 First formulated by Quine
 Later improved by McCluskey

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-3
 The Tabulation Method
 Tabular Method
 Compute all prime implicants
 Find a minimum expression for Boolean functions
 No visualization of prime implicants
 Can be programmed and implemented in a computer

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-4
 The Tabulation Method
 Example: Simplify the Boolean expression using Quine-
McCluskey method (Tabular Method)
F (A, B, C, D) =  (0, 1, 3, 7, 8, 9, 11, 15)
 Convert decimal numbers to binary numbers
Equivalent Binary
Minterms Decimal Numbers
Numbers
m0 0 0000
m1 1 0001
Table-1

m3 3 0011
m7 7 0111
m8 8 1000
m9 9 1001
m11 11 1011
m15 15 1111
Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-5
 The Tabulation Method
 Step-1: Arrange all minterms according to number of 1 as shown
in Table-2.
 Step-2: Compare each minterm in group ‘n’ with each minterm
in group (n + 1) and identify the match pairs. A match pair is a pair
of minterms which differ only in one variable. For the variables
differ place dash (-), as shown in Table-3

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-6
 The Tabulation Method
In Binary In Binary

Minterm
Minterm

Minterm
In Binary

Group
Group

Group
No.
No.

No.
A B C D A B C D A B C D

0 0 0 0 0 0 (0,1) 0 0 0 - (0,1,8,9) - 0 0 -
0 1
1 0 0 0 1 (0,8) - 0 0 0 (0,8,1,9) - 0 0 -
1
8 1 0 0 0 (1,3) 0 0 - 1 (1,3,9,11) - 0 - 1
2
3 0 0 1 1 1 (1,9) - 0 0 1 (1,9,3,11) - 0 - 1
2
9 1 0 0 1 (8,9) 1 0 0 - (3,7,11,15) - - 1 1
3
7 0 1 1 1 (3,7) 0 - 1 1 (3,11,7,15) - - 1 1
3
11 1 0 1 1 2 (3,11) - 0 1 1
4 15 1 1 1 1 (9,11) 1 0 - 1 Table-4
(7,15) - 1 1 1
Table-2 3
(11,15) 1 - 1 1

Table-3
 Step-3: Now compare all the pairs of minterms of Table-3 with those in the
adjacent groups. As shown in Table-4
Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-7
 The Tabulation Method
 Step-4: Repeat the procedure for grouping. If further grouping is
possible then there will be a group of eight minterms. No such
grouping exists in our example. Now prepare Prime Implicant
Table as shown in Table-5
In Binary

Minterm
Group

No.
A B C D

(0,1,8,9) - 0 0 -
Table-5 1 B’C’
(0,8,1,9) - 0 0 -
(1,3,9,11) - 0 - 1
2 B’D
(1,9,3,11) - 0 - 1
(3,7,11,15) - - 1 1
3 CD
(3,11,7,15) - - 1 1

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-8
 The Tabulation Method
 Find essential prime implicant. PI that covers only one minterm.
As shown in Table-6.
Minterms group & In Binary
PI
Boolean Expression 0 1 3 7 8 9 11 15

√ -00- (0,1,8,9) B’C’ X X X X

√ - -1 1 (3,7,11,15) CD X X X X

Table-6

 F ( A, B, C, D) =  (0,1,3,7,8,9,11,15) = BC + CD

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-9
 The Tabulation Method
F(W, X, Y, Z) = (2,3,6,7,8,10,11,12,14,15)
Step1
2 0010
8 1000

3 0011
6 0110
10 1010
12 1100

7 0111
11 1011
14 1110

15 1111
Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-10
Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture- 3-11