Digital Logic Design

Two-Variable K-Map
The two-variable map is shown in Fig. There are four minterms for two variables; hence, the map
consistsof four squares, one for each minterm.

x y m
0 0 xy
0 1 xy
1 0 xy
1 1 xy

x y z m Three-Variable K-Map
0 0 0 xyz A three-variable K-map is shown in Fig. There are eight
0 0 1 xyz minterms for three binary variables; therefore, the map
consistsof eight squares.
0 1 0 xyz
0 1 1 xyz
1 0 0 xyz
1 0 1 xyz
1 1 0 xyz
1 1 1 xyz
 m0 w′x′y′z′
m1 w′x′y′z
F O U R - VA R I A B L E K - M A P m2 w′x′yz′
The map for Boolean functions of four binary variables (w, x, y, z) is shown in Fig. m3 w′x′yz
In Fig. are listed the 16 minterms and the squares assigned to each
m4 w′xy′z′
 One square represents one minterm, giving a term with four literals. m5 w′xy′z
 Two adjacent squares represent a term with three literals.
m6 w′xyz′
 Four adjacent squaresrepresent a term with two literals.
 Eight adjacent squares represent a term with one literal. m7 w′xyz
m8 wx′y′z′
m9 wx′y′z
m 10 wx′yz′
m 11 wx′yz
m 12 wxy′z′
m 13 wxy′z
m 14 wxyz′
m 15 wxyz
 K Map Grouping the 1′s
The Karnaugh map uses the following rules for the simplification of expressions by grouping together
adjacent cells containing ones.
1. Groups may not include any cell containing a zero (Minterm).

2. Groups may be horizontal or vertical, but not diagonal.

3. Groups must contain 1, 2, 4, 8, or in general 2n cells. That is if n = 1, a group will contain two 1′s
since 21 = 2. If n = 2, a group will contain four 1′s since 22 = 4.
4. Each group should be as large as possible.
5. Each cell containing a one must be in at least one group.
6. Groups may overlap.
7. Groups may wrap around the table.
8. There should be as few groups as possible, as long as this does not contradict any of the previous
rules.
First Rule
Groups may not include
any cell containing a
zero (Minterm).

Second Rule
Groups may be horizontal or
vertical, but not diagonal.
3rd Rule
Groups must contain 1,
2, 4, 8, or in general 2n
cells. That is if n = 1, a
group will contain two
1′s since 21 = 2. If n = 2, a
group will contain four
1′s since 22 = 4.

4th Rule
Each group should be as
large as possible.
5th Rule
Each cell containing a
one must be in at least
one group.

6th Rule
Groups may overlap.
 7th Rule
Groups may wrap
around the table.

8th Rule
There should be as few
groups as possible, as
long as this does not
contradict any of the
previous rules.
 Two-Variable K-Map

Example1: Example 2: Example 3:

x′y
x′
y
x xy′ y′

F=m1 + m2 + m3 F=m1 + m2
= x′y + xy′ + xy = x + y F= m0+ m1 + m 2
= x′y + xy′ = x′y′+ x′y + xy′
=y′+x′y
=(y′+y)(y′+x′)
=x′+y′
Three-Variable K-Map
Example:
Simplify the Boolean function
F (x, y, z) = (2, 3, 4, 5)
x′y
F = x ′ y + xy ′

xy′
Example:
Simplify the Boolean function
F (x, y, z) = (0,2,4,5,6)

F= x ′ y ′ z ′ + x ′ y z ′ + xy ′ z ′ +x y ′ z+x yz′ F =z ′+xy′

= x ′ z ′ ( y ′ +y) +xz′ ( y ′ +y) +x y ′ z
= x ′ z ′ + xz ′ + xy ′ z
=z′+xy′z
= ( z ′ + z ) ( z ′ + xy ′ )
=z′+xy′

z′

xy′
Example:
For the Boolean function
F = A′C + A′B + AB′C + BC
(a) Express this function as a sum of minterms.
(b) Find the minimal sum-of-products expression

Solution: A′ B
a)
F = A′ C + A′ B + AB ′ C + B C C
= A′C( B+B′) + A′B(C+C′) + AB′C + BC(A+A′)
= A ′ C B + A ′ CB ′ +A ′ B C +A ′ B C ′ +A B′ C +A BC +A ′ BC
= A ′ B C + A ′ B′ C +A ′ B C ′ + AB ′ C +A BC
= ( m 3 , m 1 , m 2, m 5, m 7)
b) F =C+A ′ B
F= C + A ′ B
Example:
EXAMPLE EXAMPLE
Simplify the Boolean function Simplify the Boolean function
F (w, x, y, z) = (0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14) F (w, x, y, z) = (0, 1, 2, 4, 5, 6, 9, 12, 13, 14)

w′z′ w′z′

y′z
xz′ xz′
y′
F = y′ + w′ z′ + x z′ F = y′z + w′z′ + xz′
 Product of sum simplification
Example:
Simplify the following Boolean function into
(a) sum-of-products form and
(b) product-of-sums form:
F (A, B, C, D) = (0, 1, 2, 5, 8, 9, 10) BD′
AB
B′D′ CD

A′C′D F′ = AB + CD + BD′
Applying DeMorgan′s theorem (by taking the dual
and complementing each side)
b) F = (AB + CD + BD′)′
= (AB)′(CD)′(BD′)′
=(A′ + B′) (C′ + D′) (B′ + D) =POS
B′C′ a) F = B′D′ + B′C′ + A′C′D =SOP
 a) F = B′D′ + B′C′ + A′C′D =SOP

b) F = (AB + CD + BD′)′
= (AB)′(CD)′(BD′)′
=(A′ + B′) (C′ + D′) (B′ + D) =POS

This Example showed the procedure for obtaining the product-of-sums simplification when the function is
originally expressed in the sum-of-minterms canonical form.
The procedure is also valid when the function is originally expressed in the product of maxterms canonical form.
In sum-of-minterms form, this function is expressed as F (x, y, z) = (1, 3, 4, 6)
In product-of-maxterms form, it is expressed as F (x, y, z) = (0, 2, 5, 7)
In other words,the 1′s of the function represent the minterms and the 0′s represent the maxterms.
Example
Simplify the Boolean function
F (w, x, y, z) = (1, 3, 7, 11, 15)
which has the don′t-care conditions
d (w, x, y, z) = (0, 2, 5)
The minterms of F are the variable combinations that make the function equal to 1. The minterms of d are the
don′t-care minterms that may be assigned either 0 or 1. The minterms of F are marked by 1′s, those of d are
marked by X′s, and the remaining squares are filled with 0′s.

Either one of the preceding

two expressions satisfies
the conditions stated for
this example.

F = y z + w′ x ′ F = y z + w′ z
Energy crisis is a major problem in our country. So we have to control the usage of
power P in order to be a prosperous country. Hence AUST authority decided to keep
power OFF during vacation V time except special class C only. Otherwise keep power
ON in day D time unless there is special class in night time. So what will be the
Boolean function?

V C D P Case
0 0 0 0 OFF
0 0 1 1 Day time regular class
0 1 0 1 Night time special class
0 1 1 1 Both time class
1 0 0 0 OFF
From K-map
1 0 1 0 Day time OFF on vacation P=VD+C
1 1 0 1 Special class on vacation
1 1 1 1 Special class on vacation