SOP Standard form

In SOP standard form, every variable in the domain must

appear in each term. This form is useful for constructing
truth tables or for implementing logic in PLDs.
You can expand a nonstandard term to standard form by multiplying the
term by a term consisting of the sum of the missing variable and its
complement.
Convert X = A B + A B C to standard form.
The first term does not include the variable C. Therefore,
multiply it by the (C + C), which = 1:
X = A B (C + C) + A B C
=ABC+ABC+ABC

ABC  AB  ABC D
 ABCD  ABC D  ABCD  ABC D  ABC D  ABC D  ABC D

1
POS Standard form
In POS standard form, every variable in the domain must
appear in each sum term of the expression.
You can expand a nonstandard POS expression to standard form by
adding the product of the missing variable and its complement and
applying rule 12, which states that (A + B)(A + C) = A + BC.

Convert X = (A + B)(A + B + C) to standard form.

The first sum term does not include the variable C.
Therefore, add C C and expand the result by rule 12.
X = (A + B + C C)(A + B + C)
= (A +B + C )(A + B + C)(A + B + C)
( 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)

2
 Converting SOP–POS

ABC  ABC  ABC  ABC  ABC

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

3
 Boolean Expressions and Truth Tables—SOP
Form

X  ABC  ABC  ABC

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 A BC
EX . 1 0 1 0
1 1 0 0
X  ABC  A BC
1 1 1 1 ABC

4
 Boolean Expressions and Truth Tables—POS
Form

X  ( A  B  C)( A  B  C)( A  B  C)( A  B  C)( A  B  C)

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

EX . 1 0 1 0 ( A  B  C)
( A  B  C )( A  B  C )( A  B  C ) 1 1 0 0 ( A  B  C)
1 1 1 1

5
A 3-variable Karnaugh map showing product terms.

6
.
A 4-variable Karnaugh map.

7
.
Karnaugh Map SOP Minimization
.

8
.
 Example

ABC  ABC  ABC  ABC

9
.
 Example

ABCD  ABC D  ABCD  ABCD  ABC D  ABCD  ABC D

10
.
 Example

A  AB  ABC

11
.
 Example

BC  AB  ABC  ABC D  ABCD  ABCD

12
.
 Karnaugh maps
K-maps can simplify combinational logic by grouping
cells and eliminating variables that change.
Group the 1’s on the map and read the minimum logic.

C 0 1
AB
1 1. Group the 1’s into two overlapping
00
B changes groups as indicated.
across this 01 1 1 2. Read each group by eliminating any
boundary variable that changes across a
11
boundary.
10 C changes
3. The vertical group is read AC.
across this 4. The horizontal group is read AB.
boundary
X = AC +AB
13
Karnaugh maps
A 4-variable map has an adjacent cell on each of its four
boundaries as shown.
Each cell is different only by
CD CD CD CD
one variable from an adjacent
AB
cell.
AB Grouping follows the rules
AB
given in the text.
The following slide shows an
AB
example of reading a four
variable map using binary
numbers for the variables…

14
 Summary
Karnaugh maps
Group the 1’s on the map and read the minimum logic.
C changes across
outer boundary
CD
AB
00 01 11 10 1. Group the 1’s into two separate
00 1 1 groups as indicated.
B changes 2. Read each group by eliminating
01 1 1 any variable that changes across a
11 boundary.
1 1
B changes 3. The upper (yellow) group is read as
10 1 1 AD.
4. The lower (green) group is read as
C changes
AD.
X
X = AD +AD
15
16
17
Example of mapping directly from a truth table to a Karnaugh map.

18
.
Karnaugh Map POS Minimization

19
.
 Example

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

20
.
 Example

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

21
.
( B  C  D)( A  B  C  D)( A  B  C  D)( A  B  C  D)( A  B  C  D)

22
Figure 4--41 A 5-variable Karnaugh map.

23
.
Illustration of groupings of 1s in adjacent cells of a 5-variable map.

24
.
25
 Quine-McCluskey (Tabular)
Minimization
• Two step process utilizing tabular listings to:
– Identify prime implicants (implicant tables)
– Identify minimal PI set (cover tables)
• All work is done in tabular form
– Number of variables is not a limitation
– Basis for many computer implementations
– Don’t cares are easily handled
• Proper organization and term identification
are key factors for correct results
Quine-McCluskey Minimization (cont.)
• Terms are initially listed one per line in
groups
– Each group contains terms with the same
number of true and complemented variables
– Terms are listed in numerical order within group
• Terms and implicants are identified using
one of three common notations
– full variable form
– cellular form
– 1,0,- form
 Notation Forms
• Full variable form - variables and
complements in algebraic form
– hard to identify when adjacency applies
– very easy to make mistakes
• Cellular form - terms are identified by their
decimal index value
– Easy to tell when adjacency applies; indexes must
differ by power of two (one bit)
– Implicants identified by term nos. separated by
comma; differing bit pos. in () following terms
 Notation Forms (cont.)
• 1,0,- form - terms are identified by their binary
index value
– Easier to translate to/from full variable form
– Easy to identify when adjacency applies, one bit is
different
– - shows variable(s) dropped when adjacency is
used
• Different forms may be mixed during the
minimization