Digital Logic Design

ELCT201
Spring 2024

Tutorial_2
K-maps
 How to represent a Logic Function

Standard Representation Minimum Representation

x y F
• Apply Boolean algebra Rules
0 0 1 to reduce the function and
0 1 0 eliminate redundancy

1 0 1
1 1 0

Sum of Products
′ ′ ′
𝐹 =𝑥 𝑦 +𝑥 𝑦 ′
𝐹 = 𝑦 (𝑥 + 𝑥 )
′

′ 1
X’ 𝐹=𝑦
y’
y y’
X
y’

2
 HOW to represent a Logic Function

Standard Representation Minimum Representation

x y F
• Apply Boolean algebra Rules
0 0 1 to reduce the function and
0 1 0 eliminate redundancy

1 0 1
1 1 0

P
′ ′ ′ ′ ′ ′
𝐹 =𝑥𝑥
+ 𝑥𝑦+𝑥 𝑦 +𝑦 𝑦
𝐹 =( 𝑥 + 𝑦 ′ ) . (𝑥 ′ + 𝑦 ¿ ¿ ′ ) ¿ 0 ′ ′
𝐹 =¿
𝑥𝑦 +𝑥 𝑦
′
′ ′
X 𝐹 = 𝑦 (𝑥 + 𝑥 +1)
y’
1
′
X’
y’
𝐹= 𝑦
y y’
 K-maps

• The graphical solution for the reduction problem

TYPES

• Each cell corresponds to a row (No. of cells = No. of rows)

• Adjacent cells that could be combined must be powers of two
• F(x,y)  X is for rows and Y is for columns
• Avoid non-essential overlap

4
 K-maps

TYPES

Y
x y F Y
0 1
X
m0 0 0 1 0 1

m1 0 1
0 1 0
m2 1 0 1 2
3

X 1 1
m3 1 1 0

′
𝐹= 𝑦

5
 K-maps

TYPES

𝐵
m0
m1 BC
00 01 11 10
m2 A 0 1 3 2
m3
1 1
0
m4
4 5 7 6
m5
𝐴 1
m6

m7

6
K-maps

TYPES

𝑪
CD
00 01 11 10
AB 0 1 3 2
1 0 1 1
00
4 5 7 6

01
12 13 15 14
𝑩
11
𝑨 8 9 11 10

10

𝑫
7
 Problem 1

• Implement the following function using digital logic gates after

simplifying it.
a) Sum of products.
b) Product of sums.
F(A, B, C) = Σm(0, 2, 3, 4, 6)

0 1 3 2

4 5 7 6

8
 Problem 2

• Simplify the following Boolean functions using K–maps and

implement them using digital logic gates
a] 𝐹(𝐴,𝐵,𝐶,𝐷) = 𝛴𝑚(0,2,3,5,7,8,10,11,14,15)

0 1 3 2

4 5 7 6

12 13 15 14

8 9 11 10

9
 Problem 2

• Simplify the following Boolean functions using K–maps and

implement them using digital logic gates
b] 𝐹(𝐴,𝐵,𝐶,𝐷) = 𝛱𝑀(2,3,12,13,14,15)

0 1 3 2

4 5 7 6

12 13 15 14

8 9 11 10

10
 Problem 3

• Simplify the following Boolean functions using K–maps and

implement them using digital logic gates
a] F(A, B, C) = A B' C + B' C' + B C+ A B + A' B C '

0 1 3 2

4 5 7 6

11
 Problem 3

• Simplify the following Boolean functions using K–maps and

implement them using digital logic gates
b] 𝐹(𝑤,𝑥,𝑦,𝑧) = 𝑤′ 𝑧 + 𝑥 𝑧 + 𝑥′ 𝑦 + 𝑤 𝑥′ 𝑧

0 1 3 2

4 5 7 6

12 13 15 14

8 9 11 10

12
 Problem 3

• Simplify the following Boolean functions using K–maps and

implement them using digital logic gates
c] 𝐹 ′(𝐴,𝐵,𝐶,𝐷) = 𝐴 𝐵′ 𝐶 + 𝐵′ 𝐶′ 𝐷′ + 𝐵 𝐶 𝐷 + 𝐴 𝐶 𝐷′ + 𝐴′ 𝐵′ 𝐶 + 𝐴′
𝐵 𝐶′ 𝐷

0 1 3 2

4 5 7 6

12 13 15 14

8 9 11 10

13
 Problem 4

• Simplify the following Boolean functions using K–maps and

implement them using digital logic gates
a] 𝐹(𝑥,𝑦,𝑧) = (0,1,2,4,5)
𝑎 𝑛𝑑 𝑑(3,6,7)

0 1 3 2

4 5 7 6

12 13 15 14

8 9 11 10

14
 Problem 4

• Simplify the following Boolean functions using K–maps and

implement them using digital logic gates
b] F(A, B, C, D) = Σ(0, 6, 8, 13, 14) and d(A, B, C, D) = Σ(2, 4, 10)

0 1 3 2

4 5 7 6

12 13 15 14

8 9 11 10

15
 Problem 5

• Using K–maps, find in the simplest form the sum of products of the
function F = t ·g, where t and g are expressed as follows
t = w x y' + y' z + w' y z' + x' y z'
g = (w + x + y' + z') (x' + y' + z) (w' + y + z)

0 1 3 2 0 1 3 2 0 1 3 2

4 5 7 6 4 5 7 6 4 5 7 6

12 13 15 14 12 13 15 14 12 13 15 14

8 9 11 10 8 9 11 10 8 9 11 10

17
 Problem 7:

• Write down the logic functions for the following circuit

18