Lecture 7

Logic Simplification
 Simplification Using Boolean Algebra

 A simplified Boolean expression uses the fewest

gates possible to implement a given expression.

AB+A(B+C)+B(B+C)
B
C
 Simplification Using Boolean Algebra
 AB+A(B+C)+B(B+C)
A
 (distributive law)
 AB+AB+AC+BB+BC B
C AB+A(B+C)+B(B+C)
 (rule 7; BB=B)
 AB+AB+AC+B
AB+AB+AC+ B+BC
 (rule 5; AB+AB=AB)
 AB+AC+B+BC
AB +AC+B+BC B B+AC
 (rule 10; B+BC=B)
A
 AB+AC+B
AB+AC+ B C
 (rule 10; AB+B=B)
 B+AC
 Simplification Using Boolean Algebra

Assignment

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

8
Standard Forms of Boolean Expressions

 All Boolean expressions, regardless of their

form, can be converted into either of two
standard forms:
 The sum-
sum-of
of--products (SOP) form
 The product-
product-ofof--sums (POS) form
 Standardization makes the evaluation,
simplification, and implementation of Boolean
expressions much more systematic and easier.
Sum--of
Sum of--Products (SOP)
 The Sum-
Sum-of
of--Products (SOP) Form
 An SOP expression   In an SOP form, a
when two or more single overbar cannot
product terms are extend over more than
summed by Boolean one variable; however,
addition. more than one variable
 Examples: in a term can have an
AB  ABC overbar:
ABC  CDE  B CD  example: A B C is OK!
A B  A BC  AC
 Also:  not: ABC
But not:
A  A B C  BCD
 Implementation of an SOP
X=AB+BCD+AC
 AND/OR implementation  NAND/NAND implementation

A A
B B

B B
C X C X
D D

A A
C C
 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
 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
 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.
 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

8
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.
Product--of
Product of--Sums (POS)
 The Product-
Product-of
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
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:
not: A  B  C
A ( A  B  C )( B  C  D )
 Implementation of a POS
X=(A+B)(B+C+D)(A+C)

 OR/AND implementation

A
B

B
C X
D

A
C
 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
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)
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.
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)
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.
SOP/POS
 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.
 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.
 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 )
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.
 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.
 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
0 0 1 1 ABC
A B C  AB C  ABC
0 1 0 0
0 1 1 0
1 0 0 1 AB C
1 0 1 0
1 1 0 0
1 1 1 1 ABC
 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.
 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 0 0 0 0 ( A  B  C)

( A  B  C )( A  B  C )( A  B  C ) 0 0 1 1
( A  B  C )( A  B  C ) 0 1 0 0 ( A  B  C)
0 1 1 0 (A  B  C )
1 0 0 1
1 0 1 0 (A  B  C )
1 1 0 0 ( A  B  C)
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 CD
 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
 Determining Standard Expression
from a Truth Table (example)
I/P O/P  There are four 1s in  There are four 0s in
the output and the the output and the

SOP POS
A B C X
corresponding corresponding
0 0 0 0 binary value are 011, binary value are 000,
0 0 1 0 100, 110, and 111. 001, 010, and 101.
0 1 0 0
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
X  ( A  B  C )( A  B  C )( A  B  C )( A  B  C )
 Rules of Boolean Algebra

1. A  0  A 7. A  A  A
2. A  1  1 8. A  A  0
3. A  0  0 9. A  A
4. A  1  A 10. A  AB  A
5. A  A  A 11. A  A B  A  B
6. A  A  1 12.( A  B)( A  C )  A  BC
___________________________________________________________
A, B, and C can represent a single variable or a combination of variables. 7
 Assignment - 7
What are the similarities and differences in
SOP and POS.