1. Building forms.

Making the perfect normal disjunctive (SOP) and conjunctive (POS) forms

X1 X2 X3 X4 F01 SOP POS

Set #
0 0 0 0 0 1 1 1
1 0 0 0 1 1 1 1
2 0 0 1 0 1 1 1
3 0 0 1 1 0 0 0
4 0 1 0 0 0 0 0
5 0 1 0 1 0 0 0
6 0 1 1 0 0 0 0
7 0 1 1 1 0 0 0
8 1 0 0 0 1 1 1
9 1 0 0 1 1 1 1
10 1 0 1 0 0 0 0
11 1 0 1 1 0 0 0
12 1 1 0 0 0 0 0
13 1 1 0 1 1 1 1
14 1 1 1 0 0 0 0
15 1 1 1 1 0 0 0

2 Minimize the perfect disjunctive normal form by Quine method

Set number Glued sets Implicants

0 x1x2x3x4* 0&1 x1x2x3
1 x1x2x3x4* 0&2 x1x2x4
2 x1x2x3x4* 0&8 x2x3x4
8 x1x2x3x4* 8&9 x1x2x3
9 x1x2x3x4* 9 & 13 x1x3x4
13 x1x2x3x4*

Set number Glued sets Implicants

0&1 x1x2x3* 0&18&9 x2x3
0&2 x1x2x4
0&8 x2x3x4
8&9 x1x2x3*
9 & 13 x1x3x4

Implicant table
0 1 2 8 9
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
0&2 x1x2x4 Λ Λ
0&8 x2x3x4 Λ Λ
9 & 13 x1x3x4
0 & 1 8 & 9 x2x3 Λ Λ Λ Λ

Simplified Implicant table

0 8
x1x2x3x4 x1x2x3x4
0&8 x2x3x4 Λ Λ

Deadlock SOP

x1x2x4 + x1x3x4 +

3 Minimize the perfect disjunctive normal form by McClusky – Quine method

4 Compare the minimal disjunctive normal forms of logic functions

5 Check results
From Karnaugh Minimization Program
B'C' + A'B'D' + AC'D
ctive (POS) forms

Check for
minimal
SOP
1
1
1
0
0
0
0
0
1
1
0
0
0
1
0
0

13
x1x2x3x4*

Λ
x2x3