Mansoura University

Faculty of Computers and Information

Department of Information Technology
Second Semester- 2020-2021

[IT124P] Digital Logic Circuit

Grade: FIRST YEAR
Naira Elazab Marwa Gamal
OUTLINE :

‣Karnaugh Map’s definition

‣2-Level K-Map
‣3-Level K-Map
‣4-Level K-Map
 Karnaugh map (K-map)

▪ Karnaugh map is used for minimization or simplification Boolean

expressions to their minimum form.
▪ Karnaugh maps (K-maps) are graphical representations of Boolean
functions.
▪ One map cell corresponds to a row in the truth table.
▪ Also, one map cell corresponds to a minterm or a maxterm in the
Boolean expression
 TWO-VARIABLE MAP
y
x 0 1
0 1
0 m0 m1
2 3
1 m2 m3

NOTE: ordering of variables is IMPORTANT for f(x,y), x1 is the row,

x2 is the column.
Cell 0 represents x’y’; Cell 1 represents x’y; etc. If a minterm is
present in the function, then a 1 is placed in the corresponding cell.
THREE-VARIABLE MAP

yz
x 00 01 11 10
0 1 3 2

0 m0 m1 m3 m2
4 5 7 6

1 m4 m5 m7 m6

-Note: variable ordering is (x,y,z); yz specifies column, x specifies

row.
-Each cell is adjacent to three other cells (left or right or top or
bottom or edge wrap)
MINIMIZATION AS SOP USING K-MAP

❑ Enter 1s in the K-map for each product term in the function

❑ Group adjacent K-map cells containing 1s to obtain a product with fewer variables. Group size must be in power
of 2 (2, 4, 8, …)
❑ Handle “boundary wrap” for K-maps of 3 or more variables.
 2-level Karnaugh map
B
0 1
A

0 1 Out = B
f(A,B)= ∑(1,3)

1 1

7
 f(A, B, C) = ∑ m(0,3,6,7) f(A, B, C) = ∑ m(0,1,2,4,5,7)

BC 00 01 11 10 BC 00 01 11 10
A
A
0 1 1
0 1 1 1

1 1 1 1 1 1 1

GROUPING THE 1S (EXAMPLE)

 BC 00 01 11 10 BC 00 01 11 10
A
A
0 1 1
0 1 1 1

1 1 1 1 1 1 1

AB + BC + A B C B + A C + AC

DETERMINING THE MINIMUM SOP EXPRESSION FROM

THE MAP (EXERCISES)
MORE EXAMPLES
yz
X 00 01 11 10

0 1 1
◼ f1(x, y, z) = ∑ m(2,3,5,7) 1 1 1
◼ f1(x, y, z) = x’y + xz
◼ f2(x, y, z) = ∑ m (0,1,2,3,6)

1 1 1 1
◼f2(x, y, z) = x’+yz’
1
FOUR-VARIABLE MAPS
YZ

WX 00 01 11 10

00 m0 m1 m3 m2

01 m4 m5 m7 m6

11 m12 m13 m15 m14

10 m8 m9 m11 m10

◼ Top cells are adjacent to bottom cells. Left-edge cells are adjacent to right-edge cells.
 CD CD
AB 00 01 11 10 AB 00 01 11 10

00 1 1 00 1 1

01 1 1 1 1 01 1 1 1

11 11 1 1 1

10 1 1 10 1 1 1

GROUPING THE 1S (EXAMPLE)

 CD CD D + AB C + BC
AB 00 01 11 10 00 01 11 10
AB

00 1 1 00 1 1

01 1 1 1 1 01 1 1 1

11 11 1 1 1
A B + A C + AB D
10 1 1 10 1 1 1

DETERMINING THE MINIMUM SOP EXPRESSION FROM THE

MAP (EXERCISES)
 EXAMPLE

◼ Simplify the following Boolean function (A,B,C,D) =

∑m(0,1,2,4,5,7,8,9,10,12,13).

cd
ab
1 1 1 1 1 1

1 1 1 1 1 1

1 1 1 1

1 1 1 1 1 1

g(A,B,C,D) = c’+b’d’+a’bd
 EXAMPLES

‣ Simplify the Boolean function :

YZ F(x, y, z) = ∑ (0 , 2,4,5,6)
X 00 01 11 10

0 1 1

1 1 1 1

Solution : F = Z' + XY'

 EXAMPLES

‣ Simplify the Boolean function :

yz F(w, x, y, z) = ∑ (0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14)
wx 00 01 11 10

00 1 1 1

01 1 1 1

11 1 1 1

10 1 1
Solution :F = y' + w'z' + xz'
 Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

LAB 04:
Karnaugh Map Simplification

LAB Objectives
The goal of this lab is to simplify Boolean functions using the map method which
also known as the Karnaugh map or K-map. After completing this lab:
• Students should be able to understand a simple, straight forward
procedure for minimizing Boolean functions.
• They understand how the truth table for a logical expression is
transferred to a K-map grid.

LAB Content
1. Karnaugh map
▪ Karnaugh map is used for minimization or simplification Boolean
expressions to their minimum form.
▪ Karnaugh maps (K-maps) are graphical representations of
Boolean functions.
▪ One map cell corresponds to a row in the truth table.
▪ Also, one map cell corresponds to a minterm or a maxterm in the
Boolean expression
2. Two-Variable Map

1
 Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

NOTE: ordering of variables is IMPORTANT for f(x,y), x1 is the row, x2 is the

column.
▪ Cell 0 represents x’y’; Cell 1 represents x’y; etc. If a minterm is
present in the function, then a 1 is placed in the corresponding cell.

3. Three-Variable Map

Note: variable ordering is (x,y,z); yz specifies column, x specifies row.

▪ Each cell is adjacent to three other cells (left or right or top or bottom
or edge wrap)
❖ Minimization as SOP using K-map

❑ Enter 1s in the K-map for each product term in the function

❑ Group adjacent K-map cells containing 1s to obtain a product with fewer
variables. Group size must be in power of 2 (2, 4, 8, …)
❑ Handle “boundary wrap” for K-maps of 3 or more variables.

▪ 2-level Karnaugh map simplification

f(A,B)= ∑(1,3)

2
 Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

Out = B

▪ 3-level Karnaugh map simplification

f(A, B, C) = ∑ m(0,3,6,7)

out=

AB + BC + A B C
f(A, B, C) = ∑ m(0,1,2,4,5,7)

3
 Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year
Out=

B + A C + AC
◼ f2(x, y, z) = ∑ m (0,1,2,3,6)

Out = x’+yz’
▪ 4-level Karnaugh map simplification

◼ Top cells are adjacent to bottom cells. Left-edge cells are adjacent
to right-edge cells.
Example:
f(A, B, C, D) = ∑ m(0,1,4,5, 6,7,9,11)

4
 Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

Out=

A B + A C + AB D
Example 2:
f(A, B, C, D) = ∑ m(0,2,4,5, 6,8,10,11,12,13,14)

5
 Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

Out=

D + AB C + BC

▪ Simplify the following Boolean function (A,B,C,D) = ∑ (0,1,2,4,5,7,8,9,10,12,13).

Out = c’+b’d’+a’bd

6
 Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

Homework 04:
Student Name
Student ID
Section
Dept.
Year
Date

1. Simplify the following Boolean functions, using three-variable maps:

a) F (X, Y,Z) = ∑ (0,1, 5,7)
………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

b) F (X, Y, Z) = ∑ (1,3, 5,7)

………….………..………………………………………………………………………………………………………………………….

…………………………………………………………………………………………………………………………………………………

………….………..……………………………………………………………………………………………………………………………

c) F (X, Y, Z) = ∑ (1,4, 5, 6,7)

………….………..………………………………………………………………………………………………………………………….

…………………………………………………………………………………………………………………………………………………

………….………..……………………………………………………………………………………………………………………………

d) F (x, y, z) = xyz + x'y'z + xy'z'

………….………..………………………………………………………………………………………………………………………….

…………………………………………………………………………………………………………………………………………………

………….………..……………………………………………………………………………………………………………………………

e) F (x, y, z) = x'y + yz' + y'z'

………….………..………………………………………………………………………………………………………………………….

…………………………………………………………………………………………………………………………………………………

………….………..……………………………………………………………………………………………………………………………

7
 Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

2. Simplify the following Boolean functions. using four-variable maps:

a) F (W, X, Y, Z) = ∑ (1,4, 5,6, 12, 14, 15)

………….………..………………………………………………………………………………………………………………………….

…………………………………………………………………………………………………………………………………………………

………….………..……………………………………………………………………………………………………………………………

b) F (W, X, Y, Z) = ∑ (1,5, 9,10, 11, 14, 15)

………….………..………………………………………………………………………………………………………………………….

…………………………………………………………………………………………………………………………………………………

………….………..……………………………………………………………………………………………………………………………

c) F (A, B, C, D) = ∑ (0, 1,4, 5,6, 7, 8, 9)

………….………..………………………………………………………………………………………………………………………….

…………………………………………………………………………………………………………………………………………………

………….………..……………………………………………………………………………………………………………………………

d) A'B'C'D' + AC' D' + B'CD' + A'BCD + BC'D

………….………..………………………………………………………………………………………………………………………….

…………………………………………………………………………………………………………………………………………………

………….………..……………………………………………………………………………………………………………………………

e) xyz + wy + wxy' + x'y

………….………..………………………………………………………………………………………………………………………….

…………………………………………………………………………………………………………………………………………………

………….………..……………………………………………………………………………………………………………………………