Scribd
Upload
20 views25 pages

K-Map

Uploaded by

abdulqadir.cnn
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
20 views25 pages

K-Map

Uploaded by

abdulqadir.cnn
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/ 25

K-MAP (KARNAUGH MAP)

DIGITAL AND LOGIC DESIGN

Prof. R.M. Usman Saleem


Lecturer Computer Science
INTRODUCTION OF K-MAP (KARNAUGH MAP)
• In many digital circuits and practical problems we need to find expression with
minimum variables.
• We can minimize Boolean expressions of 3, 4 variables very easily using K-
map without using any Boolean algebra theorems.
• K-map can take two forms Sum of Product (SOP) and Product of Sum (POS)
according to the need of problem.
• K-map is table like representation but it gives more information than TRUTH
TABLE.
• We fill grid of K-map with 0’s and 1’s then solve it by making groups.
Prof. R.M. Usman Saleem
Lecturer Computer Science
STEPS TO SOLVE EXPRESSION USING K-MAP-
1. Select K-map according to the number of variables.
2. Identify minterms or maxterms as given in problem.
3. For SOP put 1’s in blocks of K-map respective to the minterms (0’s elsewhere).
4. For POS put 0’s in blocks of K-map respective to the maxterms(1’s elsewhere).
5. Make rectangular groups containing total terms in power of two like 2,4,8 ..(except
1) and try to cover as many elements as you can in one group.
6. From the groups made in step 5 find the product terms and sum them up for SOP
form.

Prof. R.M. Usman Saleem


Lecturer Computer Science
KARNAUGH MAPS - RULES OF SIMPLIFICATION

• Groups may not include any cell containing a zero

Prof. R.M. Usman Saleem


Lecturer Computer Science
• Groups may be horizontal or vertical, but not diagonal.

Prof. R.M. Usman Saleem


Lecturer Computer Science
• Each group should be as large as possible.

Prof. R.M. Usman Saleem


Lecturer Computer Science
• Each cell containing a one must be in at least one group.

Prof. R.M. Usman Saleem


Lecturer Computer Science
• Groups may wrap around the table. The leftmost cell in a row may be
grouped with the rightmost cell and the top cell in a column may be
grouped with the bottom cell.

Prof. R.M. Usman Saleem


Lecturer Computer Science
• 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.

Prof. R.M. Usman Saleem


Lecturer Computer Science
• Groups may overlap.

Prof. R.M. Usman Saleem


Lecturer Computer Science
SOP FORM :K-MAP OF 3 VARIABLES

Prof. R.M. Usman Saleem


Lecturer Computer Science
SOP FORM :K-MAP OF 3 VARIABLES
Z= ∑A,B,C(1,3,6,7)

Prof. R.M. Usman Saleem


Lecturer Computer Science
From red group we get product term
A’C
From green group we get product term
AB
Summing these product terms we get- Final expression
(A’C+AB)

Prof. R.M. Usman Saleem


Lecturer Computer Science
K-MAP FOR 4 VARIABLES

Prof. R.M. Usman Saleem


Lecturer Computer Science
K-MAP FOR 4 VARIABLES
F(P,Q,R,S)=∑(0,2,5,7,8,10,13,15)
F=∑((P`Q`R`S`)+(P`Q`RS`)+(P`QR`S)+(P`QRS)
+(PQ`R`S`)+(PQ`RS`)+(PQR`S)+(PQRS))

Prof. R.M. Usman Saleem


Lecturer Computer Science
POS FORM : K-MAP OF 3 VARIABLES

Prof. R.M. Usman Saleem


Lecturer Computer Science
POS FORM : K-MAP OF 3 VARIABLES
F(A,B,C)=π(0,3,6,7)

Prof. R.M. Usman Saleem


Lecturer Computer Science
SOLUTION

From red group we find terms


A B
Taking complement of these two
A' B'
Now sum up them
(A' + B')

Prof. R.M. Usman Saleem


Lecturer Computer Science
SOLUTION

From brown group we find terms


B C
Taking complement of these two terms
B’ C’
Now sum up them
(B’+C’)

Prof. R.M. Usman Saleem


Lecturer Computer Science
SOLUTION

From yellow group we find terms


A' B' C’
Taking complement of these two
A B C
Now sum up them
(A + B + C)
We will take product of these three terms : Final expression
–
(A' + B’) (B’ + C’) (A + B + C)
Prof. R.M. Usman Saleem
Lecturer Computer Science
K-MAP OF 4 VARIABLES

Prof. R.M. Usman Saleem


Lecturer Computer Science
F(A,B,C,D)=π(3,5,7,8,10,11,12,13)

Prof. R.M. Usman Saleem


Lecturer Computer Science
From green group we find terms
C’ D B
Taking their complement and summing
them
(C+D’+B’)
Prof. R.M. Usman Saleem
Lecturer Computer Science
From red group we find terms
C D A’
Taking their complement and summing them
(C’+D’+A)
From blue group we find terms
A C’ D’
Taking their complement and summing them
(A’+C+D)

Prof. R.M. Usman Saleem


Lecturer Computer Science
From brown group we find terms
A B’ C
Taking their complement and summing them
(A’+B+C’)
Finally we express these as product –
(C+D’+B’).(C’+D’+A).(A’+C+D).(A’+B+C’)

Prof. R.M. Usman Saleem


Lecturer Computer Science

You might also like