Slide 1

Today’s Lecture
Standard SOP and POS form
Need for Standard SOP and POS expressions
Converting standard SOP-POS
Minterms & Maxterms
Converting SOP & POS to truth table format
Karnaugh Maps
Mapping Standard SOP expressions
Mapping Non-Standard SOP expressions
Simplification of K-maps
Don’t care conditions

Slide 3 DR. JAVED IQBAL (SUIT PESHAWAR) JAVED.EE@SUIT.EDU.PK 9

Standard SOP and POS form

Standard SOP and POS form has all the variables in all the terms
A non-standard SOP is converted into standard SOP by using the rule
A  A  1
A non-standard POS is converted into standard POS by using the rule

AA  0

Slide 4

The Standard SOP Form

So far, you have seen SOP expressions in which some of the product terms do not contain all of
the variables in the domain of the expression. For example, the expression ABC + ABD + ABCD has
a domain made up of the variables A, B, C, and D. However, notice that the complete set of
variables in the domain is not represented in the first two terms of the expression; that is, D or D
is missing from the first term and C or C is missing from the second term.
A standard SOP expression is one in which all the variables in the domain appear in each product
term in the expression. For example, ABCD + A BCD + ABC D is a standard SOP expression.
Standard SOP expressions are important in constructing truth tables, and in the Karnaugh map
simplification method,. Any nonstandard SOP expression (referred to simply as SOP) can be
converted to the standard form using Boolean algebra.

Slide 5

•A standard SOP form has product terms that have all the variables in the domain of the
expression.
•The SOP expression AC* +BC* is not a standard SOP as the domain of the expression has
variables A, B and C.
•To convert the non-standard SOP into a standard SOP the rule A+A*=1 is used
•Applying the rule to expression AC* + BC* converts it into a standard SOP form
ABC*+AB*C*+A*BC* each product term having the three variables A, B and C

Slide 6

A standard POS form has sum terms that have all the variables in the domain of the expression.

•The POS expression having the three sum terms (A+B*+C), (A+B+D*) and (A+B*+C*+D) is not a
standard POS as the domain of the expression has variables A, B, C and D.
•To convert the non-standard POS into a standard POS the rule AA*=0 is used
•Applying the rule to expression converts it into a standard POS form each of the five sum terms
having the four variables A, B, C and D

Slide 7
•Any logic circuit can be implemented by using either the SOP, AND-OR combination of gates or
POS, OR-AND combination of gates. It is very simple to convert from standard SOP to standard
POS or vice versa. This helps in selecting an implementation that requires the minimum number
of gates.
•Secondly, the simplification of general Boolean expression by applying the laws, rules and
theorems does not always result in the simplest form as the ability to apply all the rules depends
on ones experience and knowledge of all the rules.
•A simpler mapping method uses Karnaugh maps to simplify general expressions. Mapping of all
the terms in a SOP form expression and the sum terms in a POS form can be easily done if standard
forms of SOP and POS expressions are used. Karnaugh maps will be discussed latter in the chapter.
•Lastly, the PLDs are implemented having a general purpose structure based on AND-OR arrays.
A function represented by an expression in Standard SOP form can be readily programmed.

Minterms and Maxterms

Minterms: Product terms in Standard SOP form
Maxterms: Sum terms in Standard POS form
Binary representation of Standard SOP product terms
Binary representation of Standard POS sum terms

Slide 8

Minterms and Maxterms & Binary

representations
A B C Min- Max-
terms terms
0 0 0 A .B .C A  B  C

0 0 1 A .B .C A B  C

0 1 0 A .B .C A B  C

0 1 1 A .B .C A B  C

1 0 0 A .B .C A B  C

1 0 1 A .B .C A B  C

1 1 0 A .B .C A B  C

1 1 1 A .B .C A B  C

Slide 9
 SOP-POS Conversion
Minterm values present in SOP expression not present in
corresponding POS expression
Maxterm values present in POS expression not present in
corresponding SOP expression

Slide 10

The binary values of the product terms in a given standard SOP expression are not present in
the equivalent standard POS expression. Also, the binary values that are not represented in the
SOP expression are present in the equivalent POS expression. Therefore, to convert from
standard SOP to standard POS, the following steps are taken:
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.
Using a similar procedure, you can go from POS to SOP.

SOP-POS Conversion
Canonical Sum  A, B ,C
( 0 , 2 ,3 ,5 ,7 )

A B C  A B C  A BC  A B C  ABC

Canonical Product  A, B ,C
(1 , 4 , 6 )

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

 A, B ,C
( 0 , 2 ,3 ,5 ,7 ) =  (1 , 4 , 6 )
A, B ,C

Slide 11

•The 5 sum term standard SOP expression has the binary values 000, 010,011,101 and 111.
•The expression is represented in Canonical Sum form where the variables A,B and C define the
domain of the expression. The numbers 0,2, 3, 5 and 7 represent the Minterms present in the
SOP expression.
•The missing binary values are 001, 100 and 110.
•The equivalent POS expression has the corresponding missing 3 terms as sum terms 1, 4 and 6
•The expression is represented in Canonical Product form where the variables A, B and C define
the domain of the expression. The numbers 1, 4 and 6 represent the MAxterms present in the
POS expression.
• If the 3 sum terms are multiplied together and the expression is solved, it results in the 5 sum
term SOP expression.

Boolean Expressions and Truth Tables

Standard SOP & POS expressions converted to truth table form
Standard SOP & POS expressions determined from truth table

Slide 12

All standard Boolean expressions can be easily converted into truth table format using binary
values for each term in the expression. The truth table is a common way of presenting, in a
concise format, the logical operation of a circuit. Also, standard SOP or POS expressions can be
determined from a truth table.

SOP-Truth Table Conversion

A B  BC
 A ,B , C
( 3 , 4 , 5 , 7 )  A BC  A B C  A B C  ABC
Input Output
A B C F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

Slide 13

•The steps involved in representing a SOP expression in a truth table are to first convert the
non-standard SOP expression into standard SOP expression.
•In the next step the minterms present in the standard SOP expression are marked as 1s in the
truth table output column.
•The remaining minterms that are not present in the SOP expression are marked as 0s in the
output column of the truth table.
•A standard SOP can be determined from the truth table by writing out all the minterms
marked by 1s in the output column of the truth table.
 POS-Truth Table Conversion
( A  B )( B  C )  A ,B , C
(1 , 2 , 3 , 5 )

 ( A  B  C )( A  B  C )( A  B  C )( A  B  C )
Input Output
A B C F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1

Slide 14

•The steps involved in representing a POS expression in a truth table are to first convert the
non-standard POS expression into standard POS expression.
•In the next step the maxterms present in the standard POS expression are marked as 0s in the
truth table output column.
•The remaining maxterms that are not present in the POS expression are marked as 1s in the
output column of the truth table.
•A standard POS can be determined from the truth table by writing out all the maxterms
marked by 0s in the output column of the truth table.

Karnaugh Map
Simplification of Boolean Expressions
◦ Doesn’t guarantee simplest form of expression
◦ Terms are not obvious
◦ Skills of applying rules and laws
K-map provides a systematic method
◦ An array of cells
◦ Used for simplifying 2, 3, 4 and 5 variable expressions

Slide 15

A Karnaugh 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. As you have seen, the effectiveness of algebraic simplification depends on your
familiarity with all the laws, rules, and theorems of Boolean algebra and on your ability to apply
them. The Karnaugh map, on the other hand, provides a “straightforward” method for
simplification. Other simplification techniques include the Quine-McCluskey method and the
Espresso algorithm.
A Karnaugh map is similar to a truth table because it presents all of the possible values of input
variables and the resulting output for each value. Instead of being organized into columns and
rows like a truth table, the Karnaugh map is an array of cells in which each cell represents a binary
value of the input variables. The cells are arranged in a way so that simplification of a given
expression is simply a matter of properly grouping the cells.
Karnaugh maps can be used for expressions with two, three, four, and five variables, but we will
discuss only 3-variable and 4-variable situations to illustrate the principles.
The number of cells in a Karnaugh map, as well as the number of rows in a truth table, is equal to
the total number of possible input variable combinations. For three variables, the number of cells
is 23 = 8. For four variables, the number of cells is 24 = 16.

3-Variable K-map
Used for simplifying 3-variable expressions
K-map has 8 cells representing the 8 minterms and 8 maxterms
K-map can be represented in row format or column format

Slide 16

4-Variable K-map
Used for simplifying 4-variable expressions
K-map has 16 cells representing the 16 minterms and 16 maxterms
A 4-variable K-map has a square format

Slide 17
 3-Variable K-map
AB\C 0 1
A\BC 00 01 11 10

00 0 1 0 0 1 3 2

1 4 5 7 6
01 2 3

11 6 7

10 4 5

Slide 18

•The 3 variable K-map has 8 cells.

•The 8 cells can be arranged in 2 columns and 4 rows representing the column form of the
Karnaugh Map
•Alternately the 8 cells can be organized in 2 rows and 4 columns representing the row form of
the Karnaugh map.
•Any of the two forms of the Karnaugh Map can be used to simplify Boolean expressions.
•The simplified expressions using either of the two K-maps are identical.

•Considering first the column based 3-variable Karnuagh map.

•The binary values 00, 01, 11 and 10 in the left most column of the K-map represent the binary
values of variables A and B
•The binary values 0 and 1 in the top row of the K-map represents the binary values of variable
C.
•The 8 cells marked with numbers 0 to 7 represent the cells 0 to 7 corresponding to the minterms
0 to 7 or the maxterms 0 to 7 in a 3 variable Boolean expression.
•The cell marked 0 for example, represents the minterm 0 or the maxterm 0 having binary value
of variables A, B and C equal to 000.
•Similarly cell marked 5 represents the minterm 5 or the maxterm 5 having binary values of
variables A, B and C equal to 101.

•The 3-variable K-Map based on the row representation is considered next.

•The binary values 0 and 1 in the left most column of the K-map represent the binary values of
variable A.
•The binary values 00, 01, 11 and 10 in the top row of the K-map represent the binary values of
variables B and C
•The 8 cells marked with numbers 0 to 7 represent the cells 0 to 7 corresponding to the minterms
0 to 7 or the maxterms 0 to 7 in a 3 variable Boolean expression.
•The cell marked 1 for example, represents the minterm 1 or the maxterm 1 having binary value
of variables A, B and C equal to 001.
•Similarly cell marked 7 represents the minterm 7 or the maxterm 7 having binary values of
variables A, B and C equal to 111.
 4-Variable K-map

AB\CD 00 01 11 10

00 0 1 3 2

01 4 5 7 6

11 12 13 15 14

10 8 9 11 10

Slide 19

•The 4-variable K-Map has a square format with four rows and four columns of cells.
•The binary values 00, 01, 11 and 10 in the left most column of the K-map represent the binary
values of variables A and B
•The binary values 00, 01, 11 and 10 in the top row of the K-map represents the binary values
of variables C and D
•The 16 cells marked with numbers 0 to 15 represent the cells 0 to 15 corresponding to the
minterms 0 to 15 or the maxterms 0 to 15 in a 4 variable Boolean expression.
•The cell marked 6 for example, represents the minterm 6 or the maxterm 6 having binary value
of variables A, B, C and D equal to 0110
•Similarly cell marked 13 represents the minterm 13 or the maxterm 13 having binary values of
variables A, B, C and D equal to 1101.

Grouping & Adjacent Cells

K-map is considered to be wrapped around
All sides are adjacent to each other
Groups of 2, 4, 8,16 and 32 adjacent cells are formed
Groups can be row, column, square or rectangular.
Groups of diagonal cells are not allowed

Slide 20

END OF LECTURE 09