Module 5 (K-MAP)

Digital Logic
Dr. Anand S.
Professor
Centre for Nanotechnology Research (CNR)
Vellore Institute of Technology, Vellore
1/10/202 anand.st@vit.ac.i 1
3 n
Boolean Algebra
Developed by English Mathematician

George Boole in 1854.
It is described as an algebra of logic or an
algebra of two values i.e True or False.
The term logic means a statement
having binary decisions i.e True/Yes or
False/No.
3 n
Boolean Algebra
 It is used to perform the logical operations in

digital computer.
 In digital computer True represent by ‘1’ (high
volt) and False represent by ‘0’ (low volt)
 Logical operations are performed by
logical operators. The fundamental logical
operators are:
1. AND (conjunction)
2. OR (disjunction)
3. NOT (negation/complement)
3 n
Boolean Algebra
 It is used to perform the logical operations in

digital computer.
 In digital computer True represent by ‘1’ (high
volt) and False represent by ‘0’ (low volt)
 Logical operations are performed by
logical operators. The fundamental logical
operators are:
1. AND (conjunction)
2. OR (disjunction)
3. NOT (negation/complement)
3 n
Basic Theorems and properties
3 n
Practice Exercise
3 n
Canonical and standard forms
3 n
Example
3 n
Example
3 n
Example
3 n
Conversion between canonical
forms
3 n
Conversion between canonical forms
3 n
Conversion between canonical forms
3 n
Practice Exercise
3 n
Practice Exercise
3 n
2 Variable K Map
3 n
2 Variable K Map
3 n
2 Variable K Map
– Place 1s and 0s from the truth table in the K-
map.
– Each square of 1s = minterms.
– Minterms in adjacent squares can be combined
since they differ in only one variable. Use XY’ +
XY = X.
3 n
3 Variable K Map
3 n
3 Variable K Map
3 n
3 Variable K Map
– Note BC is listed in the order of 00, 01, 11, 10. (Gray
code)
– Minterms in adjacent squares that differ in only
one variable can be combined using XY’ + XY
= X.
3 n
3 Variable K Map
3 n
3 Variable K Map
3 n
3 Variable K Map
3 n
3 Variable K Map
3 n
3 Variable K Map
3 n
Three-Variable K-Maps
f  (0,4)  B C f  (4,5) A B f   (0,1,4,5)  B f   (0,1,2,3) A
BC BC BC BC
A 00 01 11 10 A 00 01 11 10 A 00 01 11 10 A 00 01 11 10
0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 1 1 1
1 1 0 0 0 1 1 1 0 0 1 1 1 0 0 1 0 0 0 0
f  (0,4) A C f  (4,6)  AC f  (0,2) A C f  (0,2,4,6)  C
BC BC BC BC
A 00 01 11 10 A 00 01 11 10 A 00 01 11 10 A 00 01 11 10
0 0 1 1 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1
1 0 0 0 0 1 1 0 0 1 1 0 0 0 0 1 1 0 0 1
Three-Variable K-Map Examples
BC BC BC
A 00 01 11 10 A 00 01 11 10 A 00 01 11 10
0 1 0 1 1 1 0 1 1
1 1 1 1 1 1 1 1 1 1
BC BC BC
A 00 01 11 10 A 00 01 11 10 A 00 01 11 10
0 1 0 1 1 1 0
1 1 1 1 1 1 1 1
3 Variable K Map – Practice Example
3 n
4 Variable K Map
3 n
4 Variable K Map
3 n
4 Variable K Map
1/10/202 32
3 anand.st@vit.ac.i
n
4 Variable K Map
3 n
4 Variable K Map
1/10/202 34
3
4 Variable K Map
3 n
Four-Variable K-Maps
CD CD CD CD
AB 00 01 11 10 AB 00 01 11 10 AB 00 01 11 10 AB 00 01 11 10
00 1 0 0 0 00 0 0 0 0 00 0 0 0 0 00 0 0 0 0
01 0 0 0 0 01 0 1 0 0 01 0 0 0 0 01 1 0 0 1
11 0 0 0 0 11 0 1 0 0 11 0 1 1 0 11 0 0 0 0
10 1 0 0 0 10 0 0 0 0 10 0 0 0 0 10 0 0 0 0
f  (0,8)  B  C D f  (5,13)  B C D f   (13,15)  A  BD f   (4,6)  AB D
CD CD CD CD
AB 00 01 11 10 AB 00 01 11 10 AB 00 01 11 10 AB 00 01 11 10
00 0 0 1 1 00 0 0 0 0 00 0 0 1 1 00 1 0 0 1
01 0 0 1 1 01 1 0 0 1 01 0 0 0 0 01 0 0 0 0
11 0 0 0 0 11 1 0 0 1 11 0 0 0 0 11 0 0 0 0
10 0 0 0 0 10 0 0 0 0 10 0 0 1 1 10 1 0 0 1
f  (2,3,6,7) A  C f  (4,6,12,14)  B D f  (2,3,10,11)  B  C f   (0,2,8,10)  B D

Four-Variable K-Maps
CD CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB AB
00 0 0 0 0 00 0 0 1 0 00 1 0 1 0 00 0 1 0 1
01 1 1 1 1 01 0 0 1 0 01 0 1 0 1 01 1 0 1 0
11 0 0 0 0 11 0 0 1 0 11 1 0 1 0 11 0 1 0 1
10 0 0 0 0 10 0 0 1 0 10 0 1 0 1 10 1 0 1 0
f  (0,3,5,6,9,10,12,15) f  (1,2,4,7,8,11,13,14)
f   (4,5,6,7)  A B f  (3,7,11,15)  C D
f A B  C  D f A B  C  D
CD CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB AB
00 0 1 1 0 00 1 0 0 1 00 0 0 0 0 00 1 1 1 1
01 0 1 1 0 01 1 0 0 1 01 1 1 1 1 01 0 0 0 0
11 0 1 1 0 11 1 0 0 1 11 1 1 1 1 11 0 0 0 0
10 0 1 1 0 10 1 0 0 1 10 0 0 0 0 10 1 1 1 1
f  (1,3,5,7,9,11,13,15) f  (0,2,4,6,8,10,12,14) f  (4,5,6,7,12,13,14,15) f  (0,1,2,3,8,9,10,11)

fD fD f B fB
Four-Variable K-Maps Examples
CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB
00 1 1 1 00 1 1 1 00
01 1 1 1 01 1 01 1 1 1
11 1 1 1 11 11 1 1 1
10 1 1 10 1 1 1 10 1
CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB
00 1 1 00 00
01 1 1 1 1 01 01
11 1 1 1 11 11
10 1 10 10
Practice Exercise
3 n
Product of Sums (POS) & Sum of Products (SoP)
Example
3 n
3 n
3 n
Product of Sums (POS) & Sum of Products
(SoP)
3 n
(SoP)
3 n
(SoP)
3 n
(SoP)
3 n
(SoP)
Practice
Exercise
3 n
Don’t-Care
Conditions
3 n
Don’t-Care Conditions
Example
3 n
3 n
3 n
3 n
Practice Exercise
3 n
Reference
3 n

Module 5 (K-MAP)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Module 5 (K-MAP)

Uploaded by

Copyright:

Available Formats

Digital Logic

Developed by English Mathematician

 It is used to perform the logical operations in

 It is used to perform the logical operations in

f  (0,4) A C f  (4,6)  AC f  (0,2) A C f  (0,2,4,6)  C

f  (0,8)  B  C D f  (5,13)  B C D f   (13,15)  A  BD f   (4,6)  AB D

f  (2,3,6,7) A  C f  (4,6,12,14)  B D f  (2,3,10,11)  B  C f   (0,2,8,10)  B D

f  (1,3,5,7,9,11,13,15) f  (0,2,4,6,8,10,12,14) f  (4,5,6,7,12,13,14,15) f  (0,1,2,3,8,9,10,11)

You might also like