Module 7

SIMPLIFYING BOOLEAN FUNCTIONS IN POS FORM

Important rules:
A =0
A=AA
A + B = (A + B)(A + B)
(A + B + C) (A + B + C) = (A + B)

Example:
1. Simplify F(A, B, C) = (A + B + C) (A + B + C) (A + B + C).

Solutions:

By using Boolean Algebra

Method 1:
Method 2
F = (A + B + C) (A + B + C) (A + B + C)

Apply De Morgans Theorem

 By using K-map and De Morgans Theorem

Example:
2. Simplify F (A, B, C) = (A + B + C) (A + B + C) (A + B + C) (A + B + C) (A + B + C)

Solutions:

By using Boolean Algebra

F = (A + B + C) (A + B + C) (A + B + C) (A + B + C) (A + B + C)
Method 2
F (A, B, C) = (A + B + C) (A + B + C) (A + B + C) (A + B + C) (A + B + C)

Apply De Morgans Theorem

By using K-map and De Morgans Theorem

3. Derive the simplified Boolean expression(in product of sums form) of the given truth
table below.

A B C D F
0 0 0 0 1
0 0 0 1 0
0 0 1 0 1
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 1
1 0 0 1 0
1 0 1 0 1
1 0 1 1 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0
Solution:

Using k-map

CD
AB 00 01 11 10

00 1 0 1
0

01 0 0 0
0

11 0 0 0 0

10 1 0 0 1

CD
AB 00 01 11 10

00 1 0 0 1

01 0 0 0 0

11 0 0 0 0

10 1 0 0 1

The resulting simplified Boolean expression will be = + .

So, =

Exercises:

Obtain the Simplified Boolean Expression in Product of Sums Form from the following
Karnaugh Map.

1.

BC
A 00 01 11 10

0 0 0 1
0

1 1 1 1 0

Solution:

BC
A 00 01 11 10
0 0
0 0 1

1 1 1 1 0

= +
=
+
= ( + )( + )
2.

BC
A 00 01 11 10

0 0 1 1 0

1 0 1 1 0

Solution:

BC
A 00 01 11 10

0 0 1 1 0 =
1 =
0 1 1 0

3.

YZ
X 00 01 11 10

0 0 1 0 0

1 1 1 0 0

Solution: