AS 108 - L O G I C C I R C U I T S A N D S W I T C H I N G T H E O R Y

LESSON 6 – KARNAUGH MAP

KARNAUGH MAP
- The KARNAUGH MAP is a 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.

Problems in using Algebraic Procedures:

- Procedures are difficult to apply in a systematic way
- Difficult to tell when you have arrived at a minimum solution

Map
- a diagram made up of squares, with each square representing one minterm
of the function
• A Boolean function is recognized graphically by those squares whose
minterms are included in the function.
- presents a visual diagram of all possible ways a function may be expressed
in a standard form
• By recognizing various patterns, the user can derive alternative
algebraic expressions for the same function.

NOTE: The simplified expressions produced by the map are always in the
sum- of-products or product-of-sums form.
AS 108 - L O G I C C I R C U I T S A N D S W I T C H I N G T H E O R Y

2-VARIABLE MAP
- consists of 4 squares, one for each minterm

EXAMPLE: Derive the equation of the Boolean function F based on the given
map.
F = m1 + m2 + m3
F = X’Y + X Y’ + X Y
F = X’Y + X Y’ + X Y = X’Y + X (Y’ + Y)
but (Y’ + Y) = 1
F = X’Y + X = (X + X’) (X + Y)
but (X’ + X) = 1
F= X+Y
3-VARIABLE MAP
- consists of 8 squares, one for each minterm
BASIC PROPERTIES OF ADJACENT SQUARES
- Any two(2) adjacent squares placed horizontally
or vertically (but not diagonally) to form a
rectangle correspond to minterms that differ in
only a single variable.
SIMPLIFICATION PROCESS:
One square represents a minterm of 3 literals
A rectangle of 2 squares is a product term of 2 literals
A rectangle of 4 squares represents a product term of 1 literal
A rectangle of 8 squares yields a function that is equal to 1
AS 108 - L O G I C C I R C U I T S A N D S W I T C H I N G T H E O R Y

EXAMPLE:
m5 + m7 = X Y’ Z + X Y Z
m5 + m7 = X Z(Y’ + Y) but (Y’ + Y) = 1
m5 + m7 = XZ

EXAMPLE: Simplify the Boolean function F (X,Y,Z) = Σ m(2,3,4,5) using a map.

F = (m2 + m3) + (m4 + m5)

F = [X’YZ’ + X’YZ] + [XY’Z’ + XY’Z]
F = [X’Y(Z’ + Z)] + [XY’(Z’ + Z)]
F = X’Y + XY’

EXAMPLE: Simplify the Boolean function F (X,Y,Z) = Σ m(0,2,4,6) using a map.

F = (m0 + m2) + (m4 + m6)

F = [X’Y’Z’ + X’YZ’] + [XY’Z’ + XYZ’]
F = [X’Z’(Y’ + Y)] + [XZ’(Y’ + Y)]
F = X’Z’ + XZ’
F = Z’ (X’ + X)
F = Z’

other way
F = (m0 + m2 + m4 + m6)
F = (X’Y’Z’ + X’YZ’ + XY’Z’ + XYZ’)
F = X’Z’(Y’ + Y) + XZ’(Y’ + Y)
F = X’Z’ + XZ’
F = Z’ (X’ + X)
F = Z’
AS 108 - L O G I C C I R C U I T S A N D S W I T C H I N G T H E O R Y

4-VARIABLE MAP
- consists of 16 squares, one for each minterm

SIMPLIFICATION PROCESS:
One square represents a minterm of 4 literals
A rectangle of 2 squares represents a product term of 3 literals
A rectangle of 4 squares represents a product term of 2 literals
A rectangle of 8 squares represents a product term of 1 literal
A rectangle of 16 squares yields a function that is equal to 1

EXAMPLE: Simplify the Boolean function F (W,X,Y,Z) = Σ m(0,1,2,4,5,6,8,9,12,13,

14) using a map.
AS 108 - L O G I C C I R C U I T S A N D S W I T C H I N G T H E O R Y

PRIME IMPLICANT
- a product term obtained by combining the maximum possible number of
adjacent squares in the map
- Four adjacent 1’s form a prime implicant if they are not within a group of 8
adjacent squares.
NOTE: A single 1 on a map is a prime implicant if it is not adjacent to any other 1’s.

EXAMPLE: Simplify the Boolean function F (A,B,C,D) = ∑ m(1,3,4,5,6,7,12,14)

using a map.

EXAMPLE: Simplify the Boolean function F (A,B,C,D) = ∑ m(0,5,10,11,12,13,15)

using a map.
AS 108 - L O G I C C I R C U I T S A N D S W I T C H I N G T H E O R Y

PRODUCT-OF-SUM SIMPLIFICATION
- The procedure for obtaining a simplified expression from sum-of-product to
the product-of-sum form can be obtained from the basic properties of
Boolean functions.
- The 1’s placed in the squares of the map represent the minterms of the
function. The minterms not included in the function represents the
complement of the function.
- The minterms not included in the function is represented in the map by the
squares not marked by 1’s.
- The simplified expression of the function is obtained by marking the empty
squares with 0’s and combining them into valid rectangles.
- To obtain the function F as a product of sums, take the complement of F’ (by
taking the dual and complementing each literal).

EXAMPLE: Simplify the Boolean function F (W,X,Y,Z) = ∑ m(0,1,2,5,8,9,10) using

a map.
F’ = YZ + WX + XZ’
Take the dual of the OR operation
(YZ) (WX) (XZ’)
Take the dual of the logical operations
inside the parentheses
(Y+Z) (W+X) (X+Z’)
Complement each literal
F = (Y’+Z’) (W’+X’) (X’+Z)

DON’T CARE CONDITIONS

- The minterms of a Boolean function specify all combinations of variable
values for which a function is equal to 1. The function is assumed to be equal
to 0 for the rest of the minterms.
- This asumption, however, is not always valid, since there are applications n
which the function is not specified for certain variable combinations.

CASE 1: THE INPUT COMBINATIONS NEVER OCCUR. The 4-bit binary code for
the decimal digit has six combinations that are not used and not expected
to occur.

CASE 2: THE INPUT COMBINATIONS ARE EXPECTED TO OCCUR, BUT WE DO

NOT CARE WHAT THE OUTPUTS ARE IN RESPONSE TO THESE
COMBINATIONS
AS 108 - L O G I C C I R C U I T S A N D S W I T C H I N G T H E O R Y

- Functions that have unspecified outputs for some input combinations are
called INCOMPLETELY UNSPECIFIED FUNCTIONS.
- It is customary to call the unspecified minterms of a function don’t-care
conditions.
- A don’t-care condition is represented by X.
- In choosing adjacent squares to simplify the function in the map, the don’t-
care minterms may be assumed to be either 0 or 1.

EXAMPLE: Consider the incompletely unspecified function F that has three (3)
don’t- care conditions:
F(W,X,Y,Z) = ∑ m(1,3,7,11,15) d(W,X,Y,Z) = ∑ m(0,2,5)

5-VARIABLE MAP
- consists of 32 squares, one for each minterm
- consists of two(2) 4-variable maps (V,W,X,Y,Z)
- Variable V distinguishes between the two
maps.
- One 4-variable map represents the 16 squares
where V = 0.
- The other 4-variable map represents the other
16 squares where V = 1.
- Minterms 0 through 15 belong with V = 0.
- Minterms 16 through 31 belong with V = 1.
- Each 4-variable map retains the previously
defined adjacency when taken separately.
- Each square in the V = 0 map is adjacent to the
corresponding square in the V = 1 map
AS 108 - L O G I C C I R C U I T S A N D S W I T C H I N G T H E O R Y

EXAMPLE: Simplify Boolean function F (V,W,X,Y,Z) = ∑ m(0,2,4,6,9,13,21,23,25,

29,31) using a map.

6-VARIABLE MAP
- consists of 64 squares, one for each minterm

ASSIGNMENT:
1. Simplify the Boolean function using Karnaugh Map and draw the Simplified
logic circuit:
a. F (x, y, z) = Σ m(2, 3, 4, 5)
b. F (x, y, z) = Σ m(0, 2, 4, 5, 6)
c. F (w, x, y, z) = Σ m(0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14)
2. Given the following Boolean Funtion: F = A’C + A’B + AB’C + BC
a. Express it in sum of minterms
b. Find the minimal sum of products expression.