Chapter 4, Lecture 1

Boolean Expression and

Logic Simplification Using Algebra

1 (C) 2017 Amoud University, Lec: M.M.Allabari

 Simplification Using Boolean Algebra
A simplified Boolean expression uses the fewest gates
possible to implement a given expression.

AB+A(B+C)
B +B(B+C)
C

(C) 2017 Amoud University, Lec:

2 M.M.Allabari
 Simplification Using Boolean Algebra

AB+A(B+C)+B(B+C)
(distributive law) A
 AB+AB+AC+BB+BC
(rule 7; BB=B) B
C AB+A(B+C)+B(B+C)
 AB+AB+AC+B+BC
(rule 5; AB+AB=AB)
 AB+AC+B+BC
(rule 10; B+BC=B)
 AB+AC+B B B+AC
(rule 10; AB+B=B)
A
 B+AC
C

(C) 2017 Amoud University, Lec:

3 M.M.Allabari
 Simplification Using Boolean Algebra

Try these:

[ AB (C  BD)  A B ]C
A BC  AB C  A B C  AB C  ABC
AB  AC  A B C

(C) 2017 Amoud University, Lec: 

4 M.M.Allabari
 Standard Forms of Boolean Expressions

All Boolean expressions, regardless of their

form, can be converted into either of two
standard forms:
The sum-of-products (SOP) form
The product-of-sums (POS) form
Standardization makes the evaluation,
simplification, and implementation of Boolean
expressions much more systematic and easier.

(C) 2017 Amoud University, Lec:

5 M.M.Allabari
 Sum-of-Products (SOP)

(C) 2017 Amoud University, Lec:

6 M.M.Allabari
 The Sum-of-Products (SOP) Form

An SOP expression   In an SOP form, a single

when two or more overbar cannot extend over
product terms are more than one variable;
summed by Boolean however, more than one
addition. variable in a term can have
Examples: an overbar:
 example: A B C is OK!
AB  ABC
ABC  CDE  B CD
A B  A BC  AC
 But not: ABC
Also:
A  A B C  BCD
(C) 2017 Amoud University, Lec:
7 M.M.Allabari
 General Expression  SOP
Any logic expression can be changed into SOP form
by applying Boolean algebra techniques.
ex:

A( B  CD)  AB  ACD
AB  B(CD  EF )  AB  BCD  BEF
( A  B )( B  C  D)  AB  AC  AD  BB  BC  BD
( A  B )  C  ( A  B )C  ( A  B )C  AC  BC

(C) 2017 Amoud University, Lec:

8 M.M.Allabari
 The Standard SOP Form

A standard SOP expression is one in which all the

variables in the domain appear in each product term
in the expression.
Example:
AB CD  A B CD  ABC D
Standard SOP expressions are important in:
Constructing truth tables
The Karnaugh map simplification method

(C) 2017 Amoud University, Lec:

9 M.M.Allabari
 Converting Product Terms to Standard SOP

Step 1: Multiply each nonstandard product term by a

term made up of the sum of a missing variable and its
complement. This results in two product terms.
As you know, you can multiply anything by 1 without
changing its value.
Step 2: Repeat step 1 until all resulting product term
contains all variables in the domain in either
complemented or uncomplemented form. In
converting a product term to standard form, the
number of product terms is doubled for each missing
variable.
(C) 2017 Amoud University, Lec:
10 M.M.Allabari
 Converting Product Terms to Standard SOP
(example)
Convert the following Boolean expression into
standard SOP form:
AB C  A B  ABC D

AB C  AB C ( D  D )  AB CD  AB CD

A B  A B (C  C )  A B C  A B C
A B C ( D  D )  A B C ( D  D )  A B CD  A B CD  A B C D  A B C D

AB C  A B  ABC D  AB CD  AB CD  A B CD  A B CD  A B C D  A B C D  ABC D

(C) 2017 Amoud University, Lec: 

11 M.M.Allabari
 Binary Representation of a Standard Product Term

A standard product term is equal to 1 for only one

combination of variable values.
Example:AB CD is equal to 1 when A=1, B=0, C=1,
and D=0 as shown below
AB CD  1  0  1  0  1  1  1  1  1
And this term is 0 for all other combinations of
values for the variables.

(C) 2017 Amoud University, Lec:

12 M.M.Allabari
 Product-of-Sums (POS)

(C) 2017 Amoud University, Lec:

13 M.M.Allabari
 The Product-of-Sums (POS) Form

When two or more sum  In a POS form, a single

terms are multiplied, the overbar cannot extend
result expression is a over more than one
product-of-sums (POS): variable; however, more
Examples: than one variable in a
( A  B )( A  B  C )
term can have an
( A  B  C )(C  D  E )( B  C  D) overbar:
( A  B)( A  B  C )( A  C )  example: A  B  C is OK!
Also:
 But not: A  B  C
A ( A  B  C )( B  C  D )
(C) 2017 Amoud University, Lec:
14 M.M.Allabari
 Implementation of a POS
X=(A+B)(B+C+D)(A+C)
OR/AND implementation

A
B

B
C X
D

A
C

(C) 2017 Amoud University, Lec:

15 M.M.Allabari
 The Standard POS Form
A standard POS expression is one in which all the
variables in the domain appear in each sum term in
the expression.
Example: ( A  B  C  D )( A  B  C  D)( A  B  C  D )

Standard POS expressions are important in:

Constructing truth tables
The Karnaugh map simplification method

(C) 2017 Amoud University, Lec:

16 M.M.Allabari
 Converting a Sum Term to Standard
POS

Step 1: Add to each nonstandard product term a term

made up of the product of the missing variable and its
complement. This results in two sum terms.
As you know, you can add 0 to anything without changing
its value.
Step 2: Apply rule 12  A+BC=(A+B)(A+C).
Step 3: Repeat step 1 until all resulting sum terms contain
all variable in the domain in either complemented or
uncomplemented form.

(C) 2017 Amoud University, Lec:

17 M.M.Allabari
 Converting a Sum Term to Standard POS (example)

Convert the following Boolean expression into

standard POS form:

( A  B  C )( B  C  D )( A  B  C  D)

A  B  C  A  B  C  DD  ( A  B  C  D)( A  B  C  D )

B  C  D  B  C  D  AA  ( A  B  C  D )( A  B  C  D )

( A  B  C )( B  C  D )( A  B  C  D) 
( A  B  C  D)( A  B  C  D )( A  B  C  D )( A  B  C  D )( A  B  C  D)

(C) 2017 Amoud University, Lec:

18 M.M.Allabari
 Binary Representation of a Standard Sum Term

A standard sum term is equal to 0 for only one

combination of variable values.

Example:A  B  C  D is equal to 0 when A=0, B=1, C=0, and

D=1 as shown below

A B C  D  0 1 0 1  0000  0

And this term is 1 for all other combinations of values for

the variables.

(C) 2017 Amoud University, Lec:

19 M.M.Allabari
 SOP/POS

(C) 2017 Amoud University, Lec:

20 M.M.Allabari
 Converting Standard SOP to Standard POS

The Facts:
The binary values of the product terms in a given
standard SOP expression are not present in the
equivalent standard POS expression.

The binary values that are not represented in the

SOP expression are present in the equivalent POS
expression.

(C) 2017 Amoud University, Lec:

21 M.M.Allabari
 Converting Standard SOP to Standard POS

What can you use the facts?

Convert from standard SOP to standard POS.
How?
Step 1: Evaluate each product term in the SOP
expression. That is, determine the binary numbers
that represent the product terms.
Step 2: Determine all of the binary numbers not
included in the evaluation in Step 1.
Step 3: Write the equivalent sum term for each
binary number from Step 2 and express in POS form.
(C) 2017 Amoud University, Lec:
22 M.M.Allabari
 Converting Standard SOP to Standard POS
(example)
Convert the SOP expression to an equivalent POS
expression:
A B C  A BC  A BC  AB C  ABC
The evaluation is as follows:

000  010  011  101  111

There are 8 possible combinations. The SOP expression
contains five of these, so the POS must contain the other 3
which are: 001, 100, and 110.
( A  B  C )( A  B  C )( A  B  C )
(C) 2017 Amoud University, Lec:
23 M.M.Allabari
 Boolean Expressions & Truth Tables
All standard Boolean expression can be easily
converted into truth table format using binary
values for each term in the expression.

Also, standard SOP or POS expression can be

determined from the truth table.

(C) 2017 Amoud University, Lec:

24 M.M.Allabari
Converting SOP Expressions to Truth Table Format
Recall the fact:
An SOP expression is equal to 1 only if at least one of the
product term is equal to 1.
Constructing a truth table:
Step 1: List all possible combinations of binary values of the
variables in the expression.
Step 2: Convert the SOP expression to standard form if it is
not already.
Step 3: Place a 1 in the output column (X) for each binary
value that makes the standard SOP expression a 1 and place 0
for all the remaining binary values.

(C) 2017 Amoud University, Lec:

25 M.M.Allabari
 Converting SOP Expressions to Truth Table
Format (example)

Develop a truth table for Inputs Output Product

the standard SOP A B C X Term
expression
0 0 0 0 ABC
A B C  AB C  ABC
0 0 1 1
0 1 0 0
0 1 1 0 AB C
1 0 0 1
1 0 1 0
1 1 0 0 ABC
26
(C) 2017 Amoud University, Lec:
M.M.Allabari 1 1 1 1
 Converting POS Expressions to Truth Table
Format
Recall the fact:
A POS expression is equal to 0 only if at least one of the
product term is equal to 0.
Constructing a truth table:
Step 1: List all possible combinations of binary values
of the variables in the expression.
Step 2: Convert the POS expression to standard form if
it is not already.
Step 3: Place a 0 in the output column (X) for each
binary value that makes the standard POS expression a 0
and place 1 for all the remaining binary values.
(C) 2017 Amoud University, Lec:
27 M.M.Allabari
 Converting POS Expressions to Truth Table
Format (example)
Develop a truth table for Inputs Output Product
the standard SOP A B C X Term
expression ( A  B  C)

( A  B  C )( A  B  C )( A  B  C ) 0 0 0 0
( A  B  C )( A  B  C ) 0 0 1 1 ( A  B  C)
0 1 0 0 (A B  C )
0 1 1 0
1 0 0 1 (A  B  C )
1 0 1 0 ( A  B  C)
1 1 0 0
(C) 2017 Amoud University, Lec:
28 M.M.Allabari 1 1 1 1
 Determining Standard Expression from a
Truth Table
To determine the standard SOP expression represented
by a truth table.
Instructions:
Step 1: List the binary values of the input variables
for which the output is 1.
Step 2: Convert each binary value to the
corresponding product term by replacing:
each 1 with the corresponding variable, and
each 0 with the corresponding variable complement.
Example: 1010 
AB C D
(C) 2017 Amoud University, Lec:
29 M.M.Allabari
 Determining Standard Expression from a
Truth Table
To determine the standard POS expression represented by a
truth table.
Instructions:
Step 1: List the binary values of the input variables for
which the output is 0.
Step 2: Convert each binary value to the corresponding
product term by replacing:
each 1 with the corresponding variable complement, and
each 0 with the corresponding variable.
Example: 1001 

A  BC  D
(C) 2017 Amoud University, Lec:
30 M.M.Allabari
 Determining Standard Expression from a Truth
Table (example)

I/P O/P  There are four 1s in  There are four 0s in

SOP POS
A B C X the output and the the output and the
corresponding corresponding
0 0 0 0 binary value are binary value are
0 0 1 0 011, 100, 110, and 000, 001, 010, and
0 1 0 0 111. 101.
011  A BC 000  A  B  C
0 1 1 1 100  AB C 001  A  B  C
1 0 0 1 110  ABC 010  A  B  C

1 0 1 0 111  ABC 101  A  B  C

1 1 0 1 X  A BC  AB C  ABC  ABC
1 1 1 1
(C) 2017 Amoud University, Lec: X  ( A  B  C )( A  B  C )( A  B  C )( A  B  C )
31 M.M.Allabari
Rules of Boolean Algebra
 END
(C) 2017 Amoud University, Lec:
33 M.M.Allabari