Scribd
Upload
27 views8 pages

Simplifying Bolean Functions in POS Form

The document provides rules and examples for simplifying Boolean functions in product of sums (POS) form. It discusses using Boolean algebra and Karnaugh maps to simplify Boolean expressions. Two examples are given showing the step-by-step work of simplifying Boolean functions using these methods. The document concludes with exercises asking to obtain the simplified Boolean expression in POS form from given Karnaugh maps.

Uploaded by

Jimmy Orajay
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
27 views8 pages

Simplifying Bolean Functions in POS Form

The document provides rules and examples for simplifying Boolean functions in product of sums (POS) form. It discusses using Boolean algebra and Karnaugh maps to simplify Boolean expressions. Two examples are given showing the step-by-step work of simplifying Boolean functions using these methods. The document concludes with exercises asking to obtain the simplified Boolean expression in POS form from given Karnaugh maps.

Uploaded by

Jimmy Orajay
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/ 8

Module 7

SIMPLIFYING BOOLEAN FUNCTIONS IN POS FORM


Important rules:
A 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 1
0

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 1
0

1 1 1 1 0

Q= A B+ B C
A B+
Q= B C
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=C
Q=C
1 0 1 1 0

3.

YZ
00
X 00 01 11 10

0 0 1

1 1 1 0 0

Solution:

You might also like