CE232 DIGITAL SYSTEM

Topic 5. Simplification
of Logical Equations
using Tabular Method

Prepared by Nabila Husna Shabrina

Contact : nabila.husna@umn.ac.id
Subtopic

5.1 Tabular 5.2 Quine-

Method McCluskey Method

3.3 Boolean
Function with
Logic Gates

2 CE232 Digital Systems

“
5.1 Tabular Method
5.1 Tabular Method

• The tabular method (also known as the Quine-McCluskey method) is

particularly useful when minimizing functions having a large number of
variables, for example for 6 variables functions
• The method reduces a function in standard sum of products (SSOP) form
to a set of prime implicants from which as many variables are eliminated
as possible
• The tabular method makes repeated use of the law 𝐴 + 𝐴ҧ = 1

4 CE232 Digital Systems

“
5.2 Quine-McCluskey
Method
5.2 Quine-McCluskey Method

• The Quine-McCluskey method is an exact algorithm which finds a minimum-

cost sum-of-products implementation of a Boolean function
• 2 basic concept in Quine-McCluskey Method :
• Prime Implicants
Implicants : groups of ‘1’
Prime implicants : largest possible groups of ‘1’
• Essential Prime Implicants
Prime implicants having at least 1 minterms cannot be combine in any
other way

6 CE232 Digital Systems

5.2 Quine-McCluskey Method

Step
1. Arrange the given minterms/maxterms in an ascending order and make
groups based on the number of ‘1’
2. Compare in successive groups to find “matched pair”
3. Repeat step 2 with newly formed tems till we get all prime implicants
4. Formulate prime implicants table and find essential prime implicants

7 CE232 Digital Systems

5.2 Quine-McCluskey Method

Example 1.
𝐹 𝐴, 𝐵, 𝐶, 𝐷 = σ 𝑚(0,1,3,7,8,9,11,15)
Binary representation
0 – 0000 9 – 1001
1 – 0001 11 – 1011
3 – 0011 15 – 1111
7 – 0111
8 – 1000

8 CE232 Digital Systems

5.2 Quine-McCluskey Method
Table Result
Step 1 : Arrange the given
Group Minterm ABCD
minterms in an ascending
order and make groups O m0 0000
based on the number of ‘1’ 1 m1 0001
m8 1000
2 m3 0011
m9 1001
3 m7 0111
m11 1011
4 m15 1111

9 CE232 Digital Systems

 5.2 Quine-McCluskey Method

Step 2 : Compare in successive Group Minterm ABCD

groups to find “matched pair”
O m0 0000
• Matched pair : pair of minterms Differ in 1 bit
1 m1 0001
with only differ with 1 bit m8 1000
position
2 m3 0011
• If there is a change in only one- m9 1001
bit position, take the pair of 3 m7 0111
those two min terms. Place m11 1011
symbol ‘-’ in the differed bit
4 m15 1111
position and keep the remaining
bits as it is compare n and n+1 groups, For example,
10 CE232 Digital Systems compare group of 0 with group of 1
5.2 Quine-McCluskey Method
Table Result

Step 2 : Compare in Group Matched pair ABCD

successive groups to find O m0 – m1 000-
“matched pair” m0 – m8 -000
1 m1 – m3 00–1
m1 – m9 -001
m8 – m9 100-
2 m3 – m7 0-11
m3 – m11 -011
m9 – m11 10–1
3 m7 – m15 -111
m11 – m15 1- 1 1
11 CE232 Digital Systems
5.2 Quine-McCluskey Method

Step 3 : Repeat step 2 with Group Matched pair ABCD

newly formed terms till we get O m0 – m1 000-
all prime implicants m0 – m8 -000
• m0-m1-m8-m3 not matched 1 m1 – m3 00–1 Differ in 1 bit
pair because there is 2 bit m1 – m9 -001
changing m8 – m9 100-
• m0-m1-m8-m9 is matched 2 m3 – m7 0-11
pair m3 – m11 -011
m9 – m11 10–1
3 m7 – m15 -111
m11 – m15 1- 1 1
12 CE232 Digital Systems
5.2 Quine-McCluskey Method

Step 3 : Repeat step 2 with newly Table Result

formed terms till we get all prime Group Matched pair ABCD
implicants 0 m0 – m1 – m8 – m9 -00-
Table Re
m0 – m8 – m1 – m9 -00-
1 m1– m3 – m9 – m11 -0–1
- 0 0 – →𝐵ത 𝐶ҧ
m1 – m9 – m3 – m11 -0–1
ത
- 0 – 1 →𝐵𝐷 PRIME
IMPLICANTS 2 m3 – m7 – m 11 – m15 0-11
- - 1 1 → 𝐶𝐷 m3 – m11 – m7 – m15 -011

13 CE232 Digital Systems

5.2 Quine-McCluskey Method

Step 4 : Formulate prime implicants table and find essential prime implicants
→ 𝐵ത 𝐶ҧ + 𝐶𝐷

P.I. Minterms Involved 0 1 3 7 8 9 11 15

𝐵ത 𝐶ҧ 0, 1, 8, 9 x x x x

ത
𝐵𝐷 1,3,9, 11 x x x x

𝐶𝐷 3, 7, 11, 15 x x x x
14 CE232 Digital Systems
5.2 Quine-McCluskey Method

Example 2. (POS form)

𝐹 𝐴, 𝐵, 𝐶, 𝐷 = ς 𝑀(0,1,3,7,8,9,11,15)
Binary representation
0 – 0000 9 – 1001
1 – 0001 11 – 1011
3 – 0011 15 – 1111
7 – 0111
8 – 1000

15 CE232 Digital Systems

5.2 Quine-McCluskey Method

Step 1 : Arrange the given maxterms in an ascending order and make groups
based on the number of ‘1’
Group Maxterms ABCD
O M0 0000
1 M1 0001
M8 1000
2 M3 0011
M9 1001
3 M7 0111
M11 1011
4 M15 1111
16 CE232 Digital Systems
5.2 Quine-McCluskey Method

Step 2 : Compare in successive Group Matched pair ABCD

groups to find “matched pair” O M0 – M1 000-
M0 – M8 -000
1 M1 – M3 00–1
M1 – M9 -001
M8 – M9 100-
2 M3 – M7 0-11
M3 – M11 -011
M9 – M11 10–1
3 M7 – M15 -111
M11 – M15 1- 1 1
17 CE232 Digital Systems
5.2 Quine-McCluskey Method

Step 3 : Repeat step 2 with newly Group Matched pair ABCD

formed terms till we get all prime 0 M0 – M1 – M8 – M9 -00-
implicants M0 – M8 – M1 – M9 -00-
1 M1– M3 – M9 – M11 -0–1
M1 – M9 – M3 – M11 -0–1
2 M3 – M7 – M 11 – M15 0-11
M3 – M11 – M7 – M15 -011
-00–→𝐵+𝐶
- 0 – 1 →B + 𝐷ഥ PRIME IMPLICANTS
- - 1 1 →𝐶ҧ + 𝐷
ഥ
18 CE232 Digital Systems
5.2 Quine-McCluskey Method

Step 4 : Formulate prime implicants table and find essential prime implicants
→ (𝐵 + 𝐶) (𝐶ҧ + 𝐷)
ഥ

P.I. Maxterms Involved 0 1 3 7 8 9 11 15

𝐵+𝐶 0, 1, 8, 9 x x x x

ഥ
B+𝐷 1,3,9, 11 x x x x

𝐶ҧ + 𝐷
ഥ 3, 7, 11, 15 x x x x
19 CE232 Digital Systems
5.2 Quine-McCluskey Method

Example 3.
Simplify F(A,B,C,D) = σ 𝑚(0,1,2,3,4,6,7,11,12,15)
Binary representation
0 – 0000 6 – 0110
1 – 0001 7 – 0111
2 – 0010 11 – 1011
3 – 0011 12 – 1100
4 – 0100 15 – 1111

20 CE232 Digital Systems

5.2 Quine-McCluskey Method

Step 1 : Arrange the Group Minterm ABCD

given minterms in an O m0 0000
ascending order and 1 m1 0001
make groups based m2 1000
on the number of ‘1’ m4 0100
2 m3 0011
m6 0110
m12 1100
3 m7 0111
m11 1011
4 m15 1111
21 CE232 Digital Systems
5.2 Quine-McCluskey Method
Group Matched pair ABCD
O m0 – m1 000–
Step 2 : Compare in successive m1 – m2 00–0
groups to find “matched pair m0 – m4 0–00
1 m1 – m3 00–1
m2 – m3 001-
m2 – m6 0–10
m4 – m6 01–0
m4 – m12 -100
2 m3 – m7 0–1 1
m3 – m11 -011
m6 – m7 011-
3 m7 – m15 -111
22 CE232 Digital Systems
m11 – m15 1–11
5.2 Quine-McCluskey Method

Step 3 : Repeat step 2 with newly Group Matched pair ABCD

formed terms till we get all prime 0 m0 – m1 – m2 – m3 00--
implicants m0 – m2 – m4 – m6 0--0
m0– m2 – m1 – m3 0 0 - - (redundant)
m0 – m4 – m2 – m6 0 - - 0 (redundant)
0 0 - - → 𝐴ҧ𝐵ത
1 m2 – m3 – m 6 – m7 0–1–
0 - - 0 → 𝐴ҧ𝐷
ഥ
m2 – m6 – m3 – m7 0 – 1 – (redundant)
PRIME
0 - 1 - → 𝐴𝐶ҧ IMPLICANTS 2 m3 – m7 – m 11 – m15 --11
- - 1 1 → CD m3 – m11 – m7 – m15 - - 1 1 (redundant)

And – 1 0 0 → B𝐶ҧ 𝐷
ഥ
23 CE232 Digital Systems
 5.2 Quine-McCluskey Method

Step 4 : Find
essential prime P.I. Minterms Involved 0 1 2 3 4 6 7 11 12 15
implicants
B𝐶ҧ 𝐷
ഥ 4, 12 X 12
B𝐶ҧ 𝐷
ഥ + 𝐴ҧ𝐵+
ത 𝐴ҧ𝐷
ഥ + CD
𝐴ҧ𝐵ത 0, 1, 2, 3 X X X X

𝐴ҧ𝐷
ഥ 0, 2, 4, 6 X X X X

ҧ
𝐴𝐶 2, 3, 6, 7 X X X X

CD 3, 7, 11, 15 X X X X
24 CE232 Digital Systems
 References

M. Morris Mano, Digital Design, 5th ed, Prentice Hall, 2012, Chapter 4
 Next Topic : Signed Number Format

26 CE232 Digital Systems