Sum-of-Products (SOP)

The Sum-of-Products (SOP) Form

An SOP expression
when two or more
product terms are
summed by Boolean
addition.

Examples:
AB ABC

ABC CDE B CD

A B A BC AC
Also:
A A B C BCD

In an SOP form, a
single overbar cannot
extend over more than
one variable; however,
more than one variable
in a term can have an
overbar:

example: A B C is OK!

But not: ABC

SOP General Expression

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

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 1111 1
And this term is 0 for all other combinations of values for
the variables.

Product-of-Sums (POS)

The Product-of-Sums (POS) Form

When two or more sum

terms are multiplied, the
result expression is a
product-of-sums (POS):

Examples:
( A B)( A B C )
( A B C )(C D E )(B C D)
( A B )( A B C )( A C )

In a POS form, a single

overbar cannot extend
over more than one
variable; however, more
than one variable in a
term can have an
overbar:

example:

But not: A B C

Also:
A ( A B C )( B C D )

A B C

is OK!

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).

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 00 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

the standard SOP
expression
A B C AB C ABC

Inputs Output Product

Term
A B C
X
0 0 0
0
0 0 1
1
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

the standard SOP
expression

( A B C )( A B C )( A B C )
( A B C )( A B C )

Inputs Output Product

Term
A B C
X
( A B C)
0 0 0
0
1
0 0 1
( A B C)
0 1 0
0
(A B C )
0 1 1
0
1
1

0
0

0
1

1
0

1
1

1
1

0
1

0
1

(A B C )
( A B C)

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
A B C
X

0
0
0
0
1
1
1
1

0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1

0
0
0
1
1
0
1
1

There are four 1s in

the output and the
corresponding
binary value are 011,
100, 110, and 111.

There are four 0s in

the output and the
corresponding
binary value are 000,
001, 010, and 101.

SOP POS
011 A BC

000 A B C

100 AB C

001 A B C

110 ABC

010 A B C

111 ABC

101 A B C

X A BC AB C ABC ABC
X ( A B C )( A B C )( A B C )( A B C )

The Karnaugh Map

The Karnaugh Map

Feel a little difficult using Boolean algebra laws,

rules, and theorems to simplify logic?
A K-map provides a systematic method for
simplifying Boolean expressions and, if properly
used, will produce the simplest SOP or POS
expression possible, known as the minimum
expression.

The 3 Variable K-Map

There are 8 cells as shown:

C

00

ABC

ABC

01

A BC

A BC

11

ABC

ABC

10

AB C

AB C

AB

The 4-Variable K-Map

CD
AB

00

01

11

10

00

ABC D

ABC D

A B CD

A B CD

01

A BC D

A BC D

A BCD

A BCD

11

ABC D

ABC D

ABCD

ABCD

10

AB C D

AB C D

AB CD

AB CD

K-Map SOP Minimization

The K-Map is used for simplifying Boolean

expressions to their minimal form.
A minimized SOP expression contains the
fewest possible terms with fewest possible
variables per term.
Generally, a minimum SOP expression can be
implemented with fewer logic gates than a
standard expression.

Mapping a Standard SOP Expression

For an SOP expression

in standard form:

A 1 is placed on the Kmap for each product

term in the expression.
Each 1 is placed in a cell
corresponding to the
value of a product term.
Example: for the product
term AB C , a 1 goes in the
101 cell on a 3-variable
map.

00

ABC

ABC

01

A BC

A BC

11

ABC

ABC

10

AB C

AB1C

AB

Mapping a Standard SOP Expression

(full example)
The expression:
A B C A B C ABC AB C
000

001

110

C
AB

A B C A BC ABC ABC
A BC AB C AB C

100

00
Practice:

01

11

A B CD A BC D ABC D ABCD ABC D A B C D AB CD

10

Mapping a Nonstandard SOP

Expression

A Boolean expression must be in standard form

before you use a K-map.

If one is not in standard form, it must be converted.

You may use the procedure mentioned earlier or

use numerical expansion.

Mapping a Nonstandard SOP

Expression

Numerical Expansion of a Nonstandard product term

Assume that one of the product terms in a certain 3-variable

SOP expression is AB .
It can be expanded numerically to standard form as follows:

Step 1: Write the binary value of the two variables and attach a 0 for
the missing variable C : 100.
Step 2: Write the binary value of the two variables and attach a 1 for
the missing variable C : 100.

The two resulting binary numbers are the values of the

standard SOP terms AB C and AB C .

If the assumption that one of the product term in a 3variable expression is B. How can we do this?

Mapping a Nonstandard SOP

Expression

Map the following SOP expressions on K-maps:

A AB ABC
BC A C
B C AB ABC AB CD A B C D AB CD
A C D ACD A BCD

K-Map Simplification of SOP

Expressions

After an SOP expression has been mapped, we

can do the process of minimization:
Grouping the 1s
Determining the minimum SOP expression from the
map

Grouping the 1s

You can group 1s on the K-map according to

the following rules by enclosing those adjacent
cells containing 1s.
The goal is to maximize the size of the groups
and to minimize the number of groups.

Grouping the 1s (rules)

1.
2.

3.
4.

A group must contain either 1,2,4,8,or 16 cells

(depending on number of variables in the expression)
Each cell in a group must be adjacent to one or more
cells in that same group, but all cells in the group do
not have to be adjacent to each other.
Always include the largest possible number of 1s in a
group in accordance with rule 1.
Each 1 on the map must be included in at least one
group. The 1s already in a group can be included in
another group as long as the overlapping groups
include noncommon 1s.

Grouping the 1s (example)

C
AB
00

10

00

01

11

01
11

C
AB

10

1
1

Grouping the 1s (example)

CD
00
AB

01

00

01

11

11
10

10

CD
00
AB

01

11

10

00

01

11

10

Determining the Minimum SOP

Expression from the Map

The following rules are applied to find the

minimum product terms and the minimum
SOP expression:
1.

Group the cells that have 1s. Each group of cell

containing 1s creates one product term composed
of all variables that occur in only one form (either
complemented or complemented) within the
group. Variables that occur both complemented
and uncomplemented within the group are
eliminated called contradictory variables.

Determining the Minimum SOP

Expression from the Map
2.

Determine the minimum product term for each

group.

For a 3-variable map:

1.
2.
3.
4.

A 1-cell group yields a 3-variable product term

A 2-cell group yields a 2-variable product term
A 4-cell group yields a 1-variable product term
An 8-cell group yields a value of 1 for the expression.

For a 4-variable map:

1.
2.
3.
4.
5.

A 1-cell group yields a 4-variable product term

A 2-cell group yields a 3-variable product term
A 4-cell group yields a 2-variable product term
An 8-cell group yields a a 1-variable product term
A 16-cell group yields a value of 1 for the expression.

Determining the Minimum SOP

Expression from the Map
3.

When all the minimum product terms are derived

from the K-map, they are summed to form the
minimum SOP expression.

Determining the Minimum SOP

Expression from the Map (example)
CD
00
AB

01

00

11

10

01

11

10

B A C AC D
AC

B
AC D

Determining the Minimum SOP

Expression from the Map (exercises)
C
AB
00

00

01

11

01
11

AB

10

10
AB BC A B C

B A C AC

Determining the Minimum SOP

Expression from the Map (exercises)
CD
00
AB

01

00

01

11

11
10

A B A C AB D

10

CD
00
AB

01

11

10

00

01

11

10

1
D AB C BC

Practicing K-Map (SOP)

AB C A BC A B C A B C AB C
B AC

B C D A BC D ABC D A B CD AB CD
A B CD A BCD ABCD AB CD
D BC

Mapping Directly from a Truth

Table
I/P

A
0
0
0
0
1
1
1
1

B
0
0
1
1
0
0
1
1

O/P

C
0
1
0
1
0
1
0
1

X
1
0
0
0
1
0
1
1

AB
00

01
11

10

Mapping a Standard POS Expression

(full example)
The expression:

( A B C )( A B C )( A B C )( A B C )

000

010

110

AB

101

00

01

11

10

K-map Simplification of POS

Expression
( A B C )( A B C )( A B C )( A B C )( A B C )

C
AB

00

01
11
B C

10

A( B C )

AB AC

0
1

AC

AB

Rules of Boolean Algebra

1. A 0 A
2. A 1 1
3. A 0 0
4. A 1 A
5. A A A
6. A A 1

7. A A A
8. A A 0
9. A A
10. A AB A
11. A A B A B
12.( A B )( A C ) A BC

___________________________________________________________
A, B, and C can represent a single variable or a combination of variables.