Scribd
Upload
51 views10 pages

Simplifying Bolean Functions in POS Form

The document discusses simplifying Boolean functions in product of sums (POS) form. It provides examples of simplifying Boolean functions using Boolean algebra rules and Karnaugh maps. It also gives exercises to derive simplified Boolean expressions from Karnaugh maps and truth tables.

Uploaded by

Ann Razon
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
51 views10 pages

Simplifying Bolean Functions in POS Form

The document discusses simplifying Boolean functions in product of sums (POS) form. It provides examples of simplifying Boolean functions using Boolean algebra rules and Karnaugh maps. It also gives exercises to derive simplified Boolean expressions from Karnaugh maps and truth tables.

Uploaded by

Ann Razon
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 10

Module 7

SIMPLIFYING BOOLEAN FUNCTIONS IN POS FORM


Review:
A• A =0
A=A•A
A + B = (A + B)(A + B)
(A + B + C)(A + B + Ć ) = (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 Morgan’s Theorem


By using K-map and De Morgan’s 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 Morgan’s Theorem


By using K-map and De Morgan’s 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 F́=B+ D .


So, F= B́ D́
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

Q́= Á B́+ B Ć
´ Á B́+
Q́= ´ B Ć
Q=( A+ B)( B́+ C)
2.

BC
A 0
00 01 11 10

0 1 1

1 0 1 1 0

Solution:

BC
A 0
00 01 11 10
0
1 1 Q́=Ć
1 0 Q=C
0 1 1

3.

YZ00 00
01 11 10
X
0 0 1

1 1 1 0 0

Solution:
Seatwork:

Part I.
Obtain the simplified Boolean functions(in product of sums form) of the following k-map. Use
F as the output.

CD
1)
AB 00 01 11 10
00 0 1 0 0

01 1 1 1 1

11 1 1 1 0

10 0 0 0 0

CD
2) AB 00 01 11 10
00 1 0 0 1

01 1 0 1 1

11 1 0 0 1

10 1 0 0 1

CD
3) AB 00 01 11 10
00 1 0 0 1

01 0 0 0 1

11 0 0 0 0

10 1 0 0 1

PART II
Obtain and simplify the Boolean expression(in product of sums form) from the given truth
table below using the following methods:
1. By applying Boolean rules
2. By using Karnaugh map

A B C D F
0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 0
1 0 0 1 1
1 0 1 0 0
1 0 1 1 1
1 1 0 0 0
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0

You might also like