Scribd
Upload
14 views28 pages

K Map

Uploaded by

Death Stroke
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views28 pages

K Map

Uploaded by

Death Stroke
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 28

Karnaugh Map (K-Map)

ENGR. DAHLIA D. FERNANDEZ


Assistant Professor III
CQMR- School of Engineering
OJT Coordinator for Computer Engineering
Switching functions can generally be simplified by using the algebraic
techniques. However, two problems arise when algebraic procedures are
used:
1. The procedures are difficult to apply systematically.
2. It is difficult to tell when you have arrived at a minimum solution

The Karnaugh Map method overcomes these difficulties by providing


systematic methods or simplifying switching functions.
➢Especially useful tool for simplifying and manipulating switching
functions of three or four variables, but it can be extended to functions
of five or more variables.
➢faster and easier to apply than other simplification methods.
Minimum Forms of Switching Functions
▪ When a function is realized using AND and OR gates, the cost of realizing the function is
directly related to the number of gates and gate inputs used. The Karnaugh map
techniques developed lead directly to minimum cost two-levelcircuits composed of AND
and OR gates.
▪ An expression consisting of a sum of product terms corresponds directly to a two-level
circuit composed of a group of AND gates feeding a single OR gate (see Figure 1)
▪ Product-of sums expression corresponds to a two-level circuit composed of OR gates
feeding a single AND gate (see Figure 2). Therefore, to find minimum cost two-level AND-
OR gate circuits, we must find minimum expressions in sum-of-products orn product-of-
sums form.

Fig. 1. Sum-of-Products Fig. 2. Products-of-Sum


A minimum Sum-of-Products
▪ A minimum sum-of-products expression for a function is defined
as a sum of product terms which:
a. has a minimum number of terms and
b. of all those expressions which have the same minimum
number of terms has a minimum number of literals
▪ The minimum sum of products corresponds directly to a minimum
two-level gate circuit which has:
a. minimum number of gates and
b. a minimum number of gate inputs.
The minimum sum-of-products
✓is not necessarily unique
✓may have two different minimum sum-of-product forms, each with the same number of
terms and the same number of literals.
Given a minterm expansion, the minimum sum-of-products form can often be obtained by
the following procedure:
1. Combine terms by using 𝑋𝑌 ′ + 𝑋𝑌 = 𝑋. Do this repeatedly to eliminate as many
literals as possible. A given term may be used more than once because 𝑋 + 𝑋 = 𝑋.
2. Eliminate redundant terms by using the consensus theorem or other theorems.

❖The result of this procedure may depend on the order in which terms are combined or
eliminated so that the final expression obtained is not necessarily minimum
Example 1: Find a minimum sum-of-products expression for

None of the terms in the above expression can be eliminated by consensus.


However, combining terms in a different way leads directly to a minimum
sum of products:
The minimum product-of-sums
A minimum product-of-sums expression for a function is defined as a product of sum
terms which
a. has a minimum number of factors, and
b. of all those expressions which have the same number of factors, has a minimum
number of literals.
c. not necessarily unique

❖The minimum product of sums can often be obtained by a procedure similar to that used
in the minimum sum-of-products case, except that the theorem is 𝑋 + 𝑌 𝑋 + 𝑌 ′ = 𝑋
used to combine terms.
Example 2: Find a minimum product-of-sums expression for
Karnaugh Maps - Rules of Simplification
Karnaugh Maps - Rules of Simplification
Karnaugh Maps - Rules of Simplification
Karnaugh Maps - Rules of Simplification
Karnaugh Maps - Rules of Simplification
Karnaugh Maps - Rules of Simplification

Summary:

1.No zeros allowed.


2.No diagonals.
3.Only power of 2 number of cells in each group.
4.Groups should be as large as possible.
5.Every one must be in at least one group.
6.Overlapping allowed.
7.Wrap around allowed.
8.Fewest number of groups possible.
Example 3:
Example 4:
Example 5:
Example 6:

AB
CD
Example 7:

CD
AB

1 0 0 0

1 0 1 1

1 0 1 1

1 0 0 0
Example 8: F = AC + AB
Example 9: F = AB’ + AC + A’BC’
Example 10:

Simplify the
truth table using
a 5-variable K-
Map
Activity
1.

ab
cd
2.
3. Find the minimum sum of products for each function using a Karnaugh map.

a. 𝑓1 𝑎, 𝑏, 𝑐 = 𝑚0 + 𝑚2 + 𝑚5 + 𝑚6 b. 𝑓4 𝑥, 𝑦, 𝑧 = 𝑀0. 𝑀5
b. 𝑓2 𝑑, 𝑒, 𝑓 = ∑𝑚(0,1,2,4) d. 𝑓3 𝑟, 𝑠, 𝑡 = 𝑟𝑡 ′ + 𝑟 ′ 𝑠 ′ + 𝑟 ′ 𝑠
4. Find the minimum sum-of-products expression for each function.

a. f(a, b, c, d ) = ∑ m(0, 1, 3, 5, 6, 7, 11, 12, 14)


b. f(a, b, c, d ) = ∏ M(1, 9, 11, 12, 14)
c. f(a, b, c, d ) = ∏ M(5, 7, 13, 14, 15) • D(1, 2, 3, 9)
4. Find the minimum sum of products and the minimum product of sums for each
function:

a. f(a, b, c, d ) = ∏ M(0,1,6,8,11,12) • ∏ D(3,7,14,15)


b. f(a, b, c, d ) = ∑ m(1,3,4,11) • ∑ d(2,7,8,12,14,15)

You might also like