4.

Boolean Algebra and Logic Simplification

• Laws and Rules of Boolean Algebra

• DeMorgan’s Theorems
• Logic Simplification Using Boolean Algebra
• Standard Forms of Boolean Expressions
• Boolean Expressions and Truth Tables
Standard Forms of Boolean Expressions

Lesson Outlines Lesson Objectives

1. The Sum-of-Products (SOP) Form ▪ To get knowledge of the two standard

2. The Standard SOP Form forms: the sum-of-products form or the
3. The Product-of-Sums (POS) Form product-of-sums form in applying
4. The Standard POS Form evaluation, simplification, and
5. Converting Standard SOP to implementation of Boolean expressions
Standard POS much more systematic and easier.

2
ㅡ
Faculty of Computer Systems and Technologies 12
Standard Forms of Boolean Expressions

1. The Sum-of-Products (SOP) Form

Logic Expressions SOP Form AND/OR Implementation of an SOP Expression

AB + ABC
ABC + CDE + BCD
AB + ABC + AC

3
ㅡ
Faculty of Computer Systems and Technologies 12
Standard Forms of Boolean Expressions
Conversion of a General Expression to SOP Form

A(B + CD) = AB + ACD

EXAMPLE 4 ̶ 4.1 Convert each of the following Boolean expressions to SOP form:
(a) AB + B(CD + EF) (b) (A + B)(B + C + D) (c) (A + B) + C
Solution:
(a) AB + B(CD + EF) = AB + BCD + BEF

(b) (A + B)(B + C + D) = AB + AC + AD + BB + BC + BD

(c) (A + B) + C = (A + B) C = (A + B)C = AC + BC

4
ㅡ
Faculty of Computer Systems and Technologies 12
Standard Forms of Boolean Expressions

2. The Standard SOP Form

A nonstandard SOP expression is converted into standard form using (A + A = 1).

EXAMPLE 4 ̶ 4.2 Convert the following Boolean expression into standard

SOP form: ABC + A B + ABCD
Solution:
A B C = ABC(D + D) = ABCD + A B C D

A B = A B (C + C) = A B C + A B C = A B C(D + D) + A B C(D + D)

=ABCD+ABCD+ABCD+ABCD

5
ㅡ
Faculty of Computer Systems and Technologies 12
Standard Forms of Boolean Expressions
Binary Representation of a Standard Product Term

▪ An SOP expression is equal to 1 only if one or more of the product terms in the expression
is equal to 1.
ABCD=1.0.1.0=1.1.1.1=1

EXAMPLE 4 ̶ 4.3

Determine the binary values for which the following standard SOP expression is equal to 1:
ABCD + A B C D + A B C D
Solution:
A = 1, B = 1, C = 1, and D = 1.
A = 1, B = 0, C = 0, and D = 1
A = 0, B = 0, C = 0, and D = 0.
6
ㅡ
Faculty of Computer Systems and Technologies 12
Standard Forms of Boolean Expressions

3. The Product-of-Sums (POS) Form

Logic Expressions POS Form OR/AND Implementation of an POS Expression

7
ㅡ
Faculty of Computer Systems and Technologies 12
Standard Forms of Boolean Expressions

4. The Standard POS Form

A nonstandard POS expression is converted into standard form using (A . A = 0).
Example of Standard Form: (A + B + C + D)(A + B + C + D)(A + B + C + D)

EXAMPLE 4 ̶ 4.4 Convert the following Boolean expression into standard POS form:
(A + B + C)(B + C + D)(A + B + C + D)
Solution:

8
ㅡ
12
Faculty of Computer Systems and Technologies
Standard Forms of Boolean Expressions
Binary Representation of a Standard Sum Term

▪ An POS expression is equal to 0 only if one or more of the sum terms in the expression is
equal to 0.
A+B+C+D=0+1+0+1=0+0+0+0=0

EXAMPLE 4 ̶ 4.5 Determine the binary values of the variables for which the following
standard POS expression is equal to 0:
Solution: (A + B + C + D)(A + B + C + D)(A + B + C + D)
A = 0, B = 0, C = 0, and D = 0.

A = 0, B = 1, C = 1, and D = 0.

A = 1, B = 1, C = 1, and D = 1.
9
ㅡ
Faculty of Computer Systems and Technologies 12
Standard Forms of Boolean Expressions
5. Converting Standard SOP to Standard POS
Step 1: Determine the binary numbers that represent the product terms.
Step 2: Determine all of the binary numbers not included in Step 1.
Step 3: Write the equivalent sum term for each binary number from Step 2 and
express in POS form.

EXAMPLE 4 ̶ 4.6 Convert the following SOP expression to an equivalent POS expression:
A B C + ABC + ABC + ABC + ABC

Step 1: 000 + 010 + 011 + 101 + 111

Step 2: 001, 100, 110
Step 3: (0+0+1) (1+0+0) (1+1+0) = (A + B + C)(A + B + C)(A + B + C)
10
ㅡ
Faculty of Computer Systems and Technologies 12
Standard Forms of Boolean Expressions

Problems

1. Convert ABC + (A + B)(B + C + A B) to SOP form.

2. Convert the expression WXY + XYZ + WXY to standard SOP form.
3. Determine the binary values for which the following SOP expression is equal to 1:
XYZ + XYZ + XYZ + XYZ + XYZ. Is this a standard SOP expression?
4. Convert the expression (A + B)(B + C) to standard POS form.
5. Determine the binary values for which the following POS expression is equal to 0:
(X + Y + Z)(X + Y + Z)(X + Y + Z)(X + Y + Z)(X + Y + Z).
Is this a standard POS expression?

11
ㅡ
Faculty of Computer Systems and Technologies 12
Thank You
For Your aTTenTion

12
ㅡ
Faculty of Computer Systems and Technologies 12