PRACTICAL FILE DIGITAL SYSTEMS AND APPLICATIONS(LAB).

Experiment 5

four variable K-map

By
Devendra (2030217)
Lab group:- G2 (sec A)
Aim :-
To simplify the given K maps and realize them using 2- input Universal Gates.

Apparatus:
Various logic gates , K-map etc..
(Logisim software used to verify virtually )

Theory
Karnaugh Map
The Karnaugh Map also called as K Map is a graphical representation that provides a systematic method for simplifying the
Boolean expressions.
For a Boolean

expression consisting of n-variables, number of cells required in K Map =

2n cells
Four Variable K Map-

•Four variable K Map is drawn for a Boolean expression consisting of four variables.
•The number of cells present in four variable K Map = 2 4 = 16 cells.
•So, for a Boolean function consisting of four variables, we draw a 4 x 4 K Map.
Here, A, B, C and D are the four variables of the given Boolean Expression.
 Given expressions for k-map assignment
Truth Table

• Y = ∑m (0,4,7,10,13,15) + ∑d (2,5,8,12) A B C D Y
0 0 0 0 0 1
K- map for this four variable problem
1 0 0 0 1 0
2 0 0 1 0 x
3 0 0 1 1 0
C’D’ C’D CD CD’
4 0 1 0 0 1
A’B’ 1 d 5 0 1 0 1 x
6 0 1 1 0 0
A’B 1 d 1 7 0 1 1 1 1
AB d 1 1 8 1 0 0 0 x
9 1 0 0 1 0
AB’ d 1 10 1 0 1 0 1
11 1 0 1 1 0
here we have three quads possible, and 12 1 1 0 0 x
Y = Q1+Q2+Q3 13 1 1 0 1 1
14 1 1 1 0 0
Y = C’D’+B’D’+BD 15 1 1 1 1 1
Y = (C’+B’)* D’ + BD
Y = BD + D’(B’C’)
Y = {(BD )’ . (D’(CB)’)’}’
 2. Y = ∑ (0,1,2,3,4,5,6) + ∑ (9,12,13,14)
m d

K- Map for this given expression

Truth Table

C’D’ C’D CD CD’

S.NO. A B C D Y
A’B’ 1 1 1 1 0 0 0 0 0 1
A’B 1 1 1 1 0 0 0 1 1
2 0 0 1 0 1
AB d d d 3 0 0 1 1 1
4 0 1 0 0 1
AB’ d
5 0 1 0 1 1
6 0 1 1 0 1
here we have three quads possible, and 7 0 1 1 1 0
Y = Q1+Q2+Q3 8 1 0 0 0 0
9 1 0 0 1 x
Y = A’B’+A’C’+ A’D’ 10 1 0 1 0 0
11 1 0 1 1 0
Y = A’(B’+C’+D’) 12 1 1 0 0 x
Y = A’ {(B’C’D’)’}’ 13 1 1 0 1 x
Y= A’ {BCD}’ 14 1 1 1 0 x
15 1 1 1 1 0
3. Y = ∑m (4,5,6,8,12). ∑d (1,2,3,7,9,11,13,14)

K- Map for this given expression

C’D’ C’D CD CD’ S.NO

A B C D Y
.
A’B’ d d d 0 0 0 0 0 1
A’B 0 0 d 0 1 0 0 0 1 x
2 0 0 1 0 x
AB 0 d d
3 0 0 1 1 x
AB’ 0 d d 4 0 1 0 0 0
5 0 1 0 1 0
here we have TWO quads possible, and 6 0 1 1 0 0
Y = Q1+Q2 7 0 1 1 1 x
Y = (A+B’) . ( A’+C) 8 1 0 0 0 0
9 1 0 0 1 x
Y = [ {(A+B’) . ( A’+C)}’]’
10 1 0 1 0 1
Y = {(A’B)+ AC’)}’
11 1 0 1 1 x
12 1 1 0 0 0
13 1 1 0 1 x
14 1 1 1 0 x
15 1 1 1 1 1
Logisim Circuits of the
given problems
Y = ∑m (0,4,7,10,13,15) + ∑d (2,5,8,12)
4 variables Sop problem with Don’t cares
Logisim Circuits of the
given problems
Y = ∑m (0,1,2,3,4,5,6) + ∑d (9,12,13,14)
4 variables Sop problem with Don’t cares
Logisim Circuits of the
given problems
Y = ∑m (4,5,6,8,12). ∑d (1,2,3,7,9,11,13,14)
4 variable POS problem
Result
• So , we can easily solve 2/3/4 variable Boolean algebra problem using
K- map & with the help of universal logic gates
In this experiment we have solved 4 variable Sop & Pos problems using
k- Map .