POS Expressions from K-Maps

Dont Cares
Technology Mapping

Further Combinational Logic

Dr DC Hendry

January 2006

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

1 POS Expressions from K-Maps

2 Dont Cares

3 Technology Mapping

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

POS Expressions from K-Maps

A product of sums (POS) expression for a Boolean function takes
the form of a number of sum terms connected by the AND
operator. For the value of the function to be logic 1, each sum
term must evaluate to 1, or in other words, each sum term must
not be 0.

f = (A + C )(A + B)(A + C )

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

POS Expressions from K-Maps

A product of sums (POS) expression for a Boolean function takes
the form of a number of sum terms connected by the AND
operator. For the value of the function to be logic 1, each sum
term must evaluate to 1, or in other words, each sum term must
not be 0.

f = (A + C )(A + B)(A + C )

We can derive such a POS expression from a K-Map as follows:

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

POS Expressions from K-Maps

A product of sums (POS) expression for a Boolean function takes
the form of a number of sum terms connected by the AND
operator. For the value of the function to be logic 1, each sum
term must evaluate to 1, or in other words, each sum term must
not be 0.

f = (A + C )(A + B)(A + C )

We can derive such a POS expression from a K-Map as follows:

1 Circle all rectangles of 0s.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

POS Expressions from K-Maps

A product of sums (POS) expression for a Boolean function takes
the form of a number of sum terms connected by the AND
operator. For the value of the function to be logic 1, each sum
term must evaluate to 1, or in other words, each sum term must
not be 0.

f = (A + C )(A + B)(A + C )

We can derive such a POS expression from a K-Map as follows:

1 Circle all rectangles of 0s.

2 For each such rectangle write down an expression which
represents the inverse of that term. By De-Morgans Laws this
gives a sum term.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

POS Expressions from K-Maps

A product of sums (POS) expression for a Boolean function takes
the form of a number of sum terms connected by the AND
operator. For the value of the function to be logic 1, each sum
term must evaluate to 1, or in other words, each sum term must
not be 0.

f = (A + C )(A + B)(A + C )

We can derive such a POS expression from a K-Map as follows:

1 Circle all rectangles of 0s.

2 For each such rectangle write down an expression which
represents the inverse of that term. By De-Morgans Laws this
gives a sum term.
3 AND together all such terms.
Dr DC Hendry Further Combinational Logic
 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example:

As an example consider expressing the Boolean function described

by the following truth table as a POS expression.

A B C f
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 0

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example:

As an example consider expressing the Boolean function described

by the following truth table as a POS expression.
which has kmap:
A B C f
0 0 0 0 f AB
0 0 1 1 00 01 11 10
0 1 0 0
0 0 0 0 1
0 1 1 1 C
1 0 0 1 1 1 1 0 0
1 0 1 0
1 1 0 0
1 1 1 0

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example:

As an example consider expressing the Boolean function described

by the following truth table as a POS expression.
which has kmap:
A B C f
0 0 0 0 f AB
0 0 1 1 00 01 11 10
0 1 0 0  
0

0 0 0 1
0 1 1 1 C
1 0 0 1 1 1 1 0 0
1 0 1 0
1 1 0 0 1 AC
1 1 1 0

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example:

As an example consider expressing the Boolean function described

by the following truth table as a POS expression.
which has kmap:
A B C f
0 0 0 0 f AB
0 0 1 1 00 01 11 10
0 1 0 0  

0

0 0 0 1
0 1 1 1 C
1 0 0 1 1 1 1
0 0
1 0 1 0
1 1 0 0 1 AC
1 1 1 0 2 AB (an alternative was B C )

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example:

As an example consider expressing the Boolean function described

by the following truth table as a POS expression.
which has kmap:
A B C f
0 0 0 0 f AB
0 0 1 1 00 01 11 10
0 1 0 0  

0

0 0 0 1
0 1 1 1 C  
1 0 0 1 1 1 1
0 0
1 0 1 0
1 1 0 0 1 AC
1 1 1 0 2 AB (an alternative was B C )
3 AC

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example:

Note that some choice does exist

here in grouping of the 0s of the
function. The three product
terms circled are:
AC
AB (an alternative was B C )
AC

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example:

Note that some choice does exist

here in grouping of the 0s of the Applying DeMorgan to each of
function. The three product these terms then gives:
terms circled are:
A+C
AC
A + B
AB (an alternative was B C )
A + C
AC

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example:

Note that some choice does exist

here in grouping of the 0s of the Applying DeMorgan to each of
function. The three product these terms then gives:
terms circled are:
A+C
AC
A + B
AB (an alternative was B C )
A + C
AC
and so the POS expression for the original function becomes:

f = (A + C )(A + B)(A + C )

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Second Example:
Assume the K-Map:

f ab
00 01 11 10
00 0 0 0 1
01 1 0 0 1
cd
11 1 0 0 0
10 1 0 0 0

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Second Example:
Assume the K-Map:

f ab The three circled groups of zeros

00 01 11 10 then represent:
 
00

0 0 0 1 1 ac d which inverts to
a+c +d
01 1 0 0 1
cd
11 1 0 0 0
10 1 0 0 0

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Second Example:
Assume the K-Map:

f ab The three circled groups of zeros

00 01 11 10 then represent:
 
 
00

0 0 0 1 1 ac d which inverts to
a+c +d
01 1 0 0 1
cd 2 b which inverts to b
11 1 0 0 0
10 1 
0 0 
0

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Second Example:
Assume the K-Map:

f ab The three circled groups of zeros

00 01 11 10 then represent:
 
 
00

0 0 0 1 1 ac d which inverts to
a+c +d
01 1 0 0 1
cd  2 b which inverts to b
11 1 0 0 0
3 ac which inverts to a + c
10 1 
0 
0 
0 

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Second Example:
Assume the K-Map:

f ab The three circled groups of zeros

00 01 11 10 then represent:
 
 
00

0 0 0 1 1 ac d which inverts to
a+c +d
01 1 0 0 1
cd  2 b which inverts to b
11 1 0 0 0
3 ac which inverts to a + c
10 1 
0 
0 
0 

And so the Boolean function as a product of sums becomes:

f = (a + c + d)(b)(a + c)

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont Cares
1 For some Boolean functions the output for certain input
combinations, that is, for certain rows of the truth table, is a
dont care.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont Cares
1 For some Boolean functions the output for certain input
combinations, that is, for certain rows of the truth table, is a
dont care.
2 This usually applies because some combination of the input
signals cannot occur.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont Cares
1 For some Boolean functions the output for certain input
combinations, that is, for certain rows of the truth table, is a
dont care.
2 This usually applies because some combination of the input
signals cannot occur.
3 It is useful to use the dont care in the minimisation of the
Boolean function.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont Cares
1 For some Boolean functions the output for certain input
combinations, that is, for certain rows of the truth table, is a
dont care.
2 This usually applies because some combination of the input
signals cannot occur.
3 It is useful to use the dont care in the minimisation of the
Boolean function.
4 Dont cares are represented on a K-Map by a - symbol, or in
some texts by X (well use - since that symbol is used with
VHDL).

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont Cares
1 For some Boolean functions the output for certain input
combinations, that is, for certain rows of the truth table, is a
dont care.
2 This usually applies because some combination of the input
signals cannot occur.
3 It is useful to use the dont care in the minimisation of the
Boolean function.
4 Dont cares are represented on a K-Map by a - symbol, or in
some texts by X (well use - since that symbol is used with
VHDL).
P
5 Using notation they are represented by for example:
X X
f = m(0, 1, 3, 5, 7) + d(2, 4)

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont Cares on a K-Map

1 By plotting dont cares on a K-Map (using the symbol -) we

can decide whether to include the dont cares in rectangles or
not.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont Cares on a K-Map

1 By plotting dont cares on a K-Map (using the symbol -) we

can decide whether to include the dont cares in rectangles or
not.
2 Since the output for a dont care is immaterial we choose to
include it in a rectangle or not, so as to provide a small
number of large rectangles.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont cares example:

Consider the following Boolean

function with three inputs:

f AB
00 01 11 10
0 0 1 1 1
C
1 - 0 - 1

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont cares example:

Consider the following Boolean

1 The dont care for ABC is
function with three inputs: included, and the product
term is then A.
f AB
00 01 11 10

0 0 1 1 1
C
1 - - 1
0  

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont cares example:

Consider the following Boolean

1 The dont care for ABC is
function with three inputs: included, and the product
term is then A.
f AB 2 The dont care for ABC is
00 01 11 10 excluded.

0 0 1 1 1
C
1 - - 1
0  

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont cares example:

Consider the following Boolean

1 The dont care for ABC is
function with three inputs: included, and the product
term is then A.
f AB 2 The dont care for ABC is
00 01 11 10 excluded.
 
 
0 0

1 1 1 3 The second product term is

C B C .
1 - 0 - 1


Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Dont cares example:

Consider the following Boolean

1 The dont care for ABC is
function with three inputs: included, and the product
term is then A.
f AB 2 The dont care for ABC is
00 01 11 10 excluded.
 
 
0 0

1 1 1 3 The second product term is

C B C .
1 - 0 - 1
 4 The minimised function is
now f = B C + A.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Specifying Dont Cares

When specifying a Boolean function using the mintern notation,

dont cares are given as follows:

X X
f = m(1, 2, 3, 5, 7) + d(10, 11, 12, 13, 14, 15)

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example with POS

Take the function represented by

the K-Map:

f ab
00 01 11 10
00 0 0 - 0
01 0 0 - 0
cd
11 0 1 - -
10 0 1 - 1

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example with POS

Take the function represented by

the K-Map:
and the two sum terms are:
f ab 1 c which inverts to c.
00 01 11 10
 
00 0 0 - 0
01 
0 0 - 0 
cd
11 0 1 - -
10 0 1 - 1

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example with POS

Take the function represented by

the K-Map:
and the two sum terms are:
f ab 1 c which inverts to c.
00 01 11 10 2 a b which inverts to a + b.

  
00 0 0 - 0
01 
0 0 - 0 
cd
11 0 1 - -
10

0 1 - 1

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example with POS

Take the function represented by

the K-Map:
and the two sum terms are:
f ab 1 c which inverts to c.
00 01 11 10 2 a b which inverts to a + b.

  
00 0 0 - 0
01 
0 0 - 0 
cd
11 0 1 - -
10

0 1 - 1

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Example with POS

Take the function represented by

the K-Map:
and the two sum terms are:
f ab 1 c which inverts to c.
00 01 11 10 2 a b which inverts to a + b.

  
00 0 0 - 0 and so the function as POS
becomes:
01 
0 0 - 0 
cd
11 0 1 - - f = c.(a + b)
10

0 1 - 1

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Technology Mapping

1 Technology Mapping refers to the process of finding a set of

logic gates to implement a Boolean expression.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Technology Mapping

1 Technology Mapping refers to the process of finding a set of

logic gates to implement a Boolean expression.
2 Generally, finding a solution is easy, but finding the optimal
solution is more difficult.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Technology Mapping

1 Technology Mapping refers to the process of finding a set of

logic gates to implement a Boolean expression.
2 Generally, finding a solution is easy, but finding the optimal
solution is more difficult.

Consider the Boolean expression:

f = ab + cd

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Technology Mapping

1 Technology Mapping refers to the process of finding a set of

logic gates to implement a Boolean expression.
2 Generally, finding a solution is easy, but finding the optimal
solution is more difficult.
a
Consider the Boolean expression:
b

f = ab + cd f
c

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Logic Gate Costs

1 For most technologies, in particular CMOS and TTL, an AND

gate is constructed as a NAND gate followed by an inverter.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Logic Gate Costs

1 For most technologies, in particular CMOS and TTL, an AND

gate is constructed as a NAND gate followed by an inverter.
2 Similary, an OR gate is constructed as a NOR gate followed
by an inverter.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Logic Gate Costs

1 For most technologies, in particular CMOS and TTL, an AND

gate is constructed as a NAND gate followed by an inverter.
2 Similary, an OR gate is constructed as a NOR gate followed
by an inverter.
3 A more efficient implementation of f = ab + cd is therefore:
a
b

f
c

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

Logic Gate Costs

1 For most technologies, in particular CMOS and TTL, an AND

gate is constructed as a NAND gate followed by an inverter.
2 Similary, an OR gate is constructed as a NOR gate followed
by an inverter.
3 A more efficient implementation of f = ab + cd is therefore:
a
b

f
c

4 This version requires 12 transistors, the previous version

requires 18 transistors.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

SOP to NAND Implementation

This transformation from AND gates followed by OR gates to one

consisting of only NAND gates works because:

f = ab + cd

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

SOP to NAND Implementation

This transformation from AND gates followed by OR gates to one

consisting of only NAND gates works because:

f = ab + cd

= ab + cd

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

SOP to NAND Implementation

This transformation from AND gates followed by OR gates to one

consisting of only NAND gates works because:

f = ab + cd

= ab + cd

= (ab) . (cd)

where the last line is obtained by x + y = x . y where x = ab and

y = cd.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

POS to NOR Implementation

1 Starting from a POS (Product of Sums) expression we can

also use De Morgans theorem in the form xy = x + y to find
an implementation using only NOR gates.

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

POS to NOR Implementation

1 Starting from a POS (Product of Sums) expression we can

also use De Morgans theorem in the form xy = x + y to find
an implementation using only NOR gates.
2 Consider the POS expression (a + b)(c + d):

f = (a + b)(c + d)

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

POS to NOR Implementation

1 Starting from a POS (Product of Sums) expression we can

also use De Morgans theorem in the form xy = x + y to find
an implementation using only NOR gates.
2 Consider the POS expression (a + b)(c + d):

f = (a + b)(c + d)

= (a + b)(c + d)

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

POS to NOR Implementation

1 Starting from a POS (Product of Sums) expression we can

also use De Morgans theorem in the form xy = x + y to find
an implementation using only NOR gates.
2 Consider the POS expression (a + b)(c + d):

f = (a + b)(c + d)

= (a + b)(c + d)

= (a + b) + (c + d)

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

NOR-NOR Circuit Diagram:

The circuit schematic for the above equation:

f = (a + b) + (c + d)

is then:

Dr DC Hendry Further Combinational Logic

 POS Expressions from K-Maps
Dont Cares
Technology Mapping

NOR-NOR Circuit Diagram:

The circuit schematic for the above equation:

f = (a + b) + (c + d)

is then:

f
c

Dr DC Hendry Further Combinational Logic