Presentation

Course Title : Digital Electronics Lab

Course Code : CSE 224

Submitted To
Tajim Md. Niamat Ullah Akhund
Department of CSE
Daffodil International University

Submitted By
Md. Sabbir Alam
ID: 192-15-2847
Section: PC (A)
Department of CSE
Daffodil International University
Date of Submission: 16 December, 2020
 Ans to the Ques No – 1
From a, b, c, d we have learned how to simplify Boolean algebraic equation with
K-Map. K-map is one of the light methods to simplify Boolean algebraic equation.
Various types of K-maps for Various Boolean algebraic equation.
2-Variable K-Map: The number of cells in 2 variable K-map is four, since the
number of variables is two. The following figure shows 2 variable K-Map.

3 Variable K-Map: The number of cells in 3 variable K-map is eight, since the
number of variables is three. The following figure shows 3 variable K-Map.

4 Variable K-Map: The number of cells in 4 variable K-map is sixteen, since the
number of variables is four. The following figure shows 4 variable K-Map.
Now solving given problem with K-Map:

Example-01: A B + A B = ? Simplify the Boolean equation with K-Map.

Solution:
B B B
A 0 1

A 0 1 1 A

A 1

∴ AB+AB=A

Example-02: A B + A B = ? Simplify the Boolean equation with K-Map.

Solution:
B B B
A 0 1

A 0 1

A 1 1

∴ AB+AB=B
Example-03: F = ABC + ABC + ABC + AC Simplify the Boolean equation with K-
Map.
Solution:
BC BC BC BC BC
A 00 01 11 10

A 0 1 1

A 1 1 1

∴ ABC + ABC + ABC + AC = C

Example-04: F = ABC + AB C + ABC + ABC + ABC Simplify the Boolean equation

with K-Map.
Solution:
BC BC BC BC BC
A 00 01 11 10

A 0 1
BC
A 1 1 1 1 1

∴ ABC + AB C + ABC + ABC + ABC = A + BC

Example-05: F = ABC + AB C + ABC + ABC Simplify the Boolean equation with K-
Map.
Solution:
BC BC BC BC BC
A 00 01 11 10

A 0 1

A 1 1 1 1

AC BC
∴ ABC + AB C + ABC + ABC = AC + BC

Example-06: F = ABCD + ABC D + AB C D + ABCD + ABCD Simplify the Boolean

equation with K-Map.
Solution:
CD CD CD CD CD
AB 00 01 11 10

A B 00

AB 01

AB 11 1 1 1 1 AB

AB 10 1

AC D

∴ ABCD + ABC D + AB C D + ABCD + ABCD = AC D + AB

Exercises-01: x y + x y’ Use Karnaugh maps find the minimal form for the
expression.
Solution:
y y’ y
x 0 1

x 0

y 1 1 1 x

∴ x y + x y’ = x

Exercises-02: x y + x’ y +x’ y’ Use Karnaugh maps find the minimal form for the
expression.
Solution:
y y’ y
x 0 1

x’ 0 1 1 x’

y 1 1

∴ x y + x’ y + x’ y’ = x’ + y
Exercises-03: x’ y +x’ y’ Use Karnaugh maps find the minimal form for the
expression.
Solution:
y y’ y
x 0 1

y’ 0 1 1 x

y 1

∴ x’ y + x’ y’ = x

Exercises-04: x y z + x y z’ +x y’ z Use Karnaugh maps find the minimal form

for the expression.
Solution:

z z’ z
xy 0 1

x’ y’ 00

x’ y 01

xy 11 1 1 xy

x y’ 10 1

xz

∴ x y z + x y z’ + x y’ z = x y + x z
Exercises-05: x y z’ + x y’ z + x y’ z’ + x’ y z + x’ y z’ + x’ y’ z Use
Karnaugh maps find the minimal form for the expression.
Solution:

z z’ z
xy 0 1

x’ y’ 00 1

x’ y 01 1 1 x’ y

xy 11 1

x y’ 10 1 1 y’ z

x z’
∴ xyz’ + xy’z + xy’z’ + x’yz + x’yz’ + x’y’z = x’ y + y’ z + x z’
Exercises-06: x y z + x y z’ + x’ y z + x’ y’ z Use Karnaugh maps find the
minimal form for the expression.
Solution:

z z’ z
xy 0 1

x’ y’ 00 1
x’ z
x’ y 01 1 1

xy 11 1 1 xy

x y’ 10

∴ x y z + x y z’ + x’ y z + x’ y’ z = x’ z + x y
Exercises-07: x y z + x y z’ + x y’ z + x y’ z’ + x’ y’ z Use Karnaugh maps
find the minimal form for the expression.
Solution:

z z’ z
xy 0 1

x’ y’ 00 1

x’ y 01
y’ z
xy 11 1 1

x y’ 10 1 1

x
∴ x y z + x y z’ + x y’ z + x y’ z’ + x’ y’ z = x + y’ z
Exercises-08: x y z t + x y z’ t + x y z t’ + x’ y z t + x’ y’ z t + x’ y z t’ Use
Karnaugh maps find the minimal form for the expression.
Solution:

yz y’ z’ y’ z yz t y’
tx 00 01 11 10
yz
t’ x’ 00 1

t’ x 01 1
txy
tx 11 1 1

t x’ 10 1 1

t x’ z

∴ xyzt + xyz’t + xyzt’ + x’yzt + x’y’zt + x’yzt’ = yz +txy + tx’z

Exercises-09: x y z’ t + x y’ z t + x y’ z’ t + x’ y z t + x’ y z’ t + x’ y z t’ +
x’y’z’t’ Use Karnaugh maps find the minimal form for the expression.
Solution:

yz y’ z’ y’ z yz t y’
tx 00 01 11 10

t’ x’ 00 1 1
x'y’z’t’
t’ x 01
x'yz
tx 11 1 1 1
tyz’
t x’ 10 1 1

txy’
∴ x y z’ t + x y’ z t + x y’ z’ t + x’ y z t + x’ y z’ t + x’ y z t’ + x’y’z’t’
= x’y’z’t’ + x’yz + tyz’ + txy’
Exercises-10: xy’z’t + x y’zt’ + xy’z’t’ + x’y’zt + x’y’z’t + x’y’zt’ + x’y’z’t’
Use Karnaugh maps find the minimal form for the expression.
Solution:

yz y’ z’ y’ z yz t y’
tx 00 01 11 10

t’ x’ 00 1 1

t’ x 01 1 1

tx 11 1

t x’ 10 1 1

∴ xy’z’t + x y’zt’ + xy’z’t’ + x’y’zt + x’y’z’t + x’y’zt’ + x’y’z’t’

= xy’z’ + x’y’z + x’y’t + y’t’z’ + y’t’x
 Ans to the Ques No - 2
SOP: Sum of Product is the abbreviated form of SOP. Sum of product form is a
form of expression in Boolean algebra in which different product terms of inputs
are being summed together. This product is not arithmetical multiply but it is
Boolean logical AND and the Sum is Boolean logical OR.
How to solve SOP with K-Map:
Step-01: f(A,B,C,D) = ∑ 𝑚(0,7,9,12,15),
Convert this decimal number to binary number
∑ 𝑚(0000,0110,1001,1100,1111)

Step-02: For SOP A = 0, A = 1 then equation will be

∑ 𝑚(0000,0110,1001,1100,1111)

= A B C D + A BCD + A B C D + AB C D + ABCD

Step-03: Then solve this A B C D + A BCD + A B C D + AB C D + ABCD with K-Map

Example: f(A,B,C,D) = ∑ 𝑚(0,7,9,12,15)

= A B C D + A BCD + A B C D + AB C D + ABCD

CD CD CD CD CD
AB 00 01 11 10

A B 00 1

AB 01 1

AB 11 1 1

AB 10 1

∴ A B C D + A BCD + A B C D + AB C D + ABCD = A B C D + A B C D + A B C D + BCD

Example: Simplify the followings with K-Map:
f(A,B,C) = ∑ 𝑚(1,4,5,6,7)

= A B C + A B C + A B C + ABC + ABC

C 𝐶 C
AB 0 1

A B 00 1

𝐴B 01

AB 11 1 1

AB 10 1 1

∴ A B C + A B C + A B C + ABC + ABC = A + B C
Example: Simplify the followings with K-Map:
f(A,B,C) = ∑ 𝑚(2,4,6,7)

= ABC + AB C + ABC + ABC

C 𝐶 C
AB 0 1

A B 00

𝐴B 01 1

AB 11 1 1

AB 10 1

∴ ABC + AB C + ABC + ABC = CB + AB + AC

Example: Simplify the followings with K-Map:
f(A,B,C,D) = ∑ 𝑚(2,4,6,7)

= A BCD + ABC D + ABCD + ABCD

CD CD CD CD CD
AB 00 01 11 10

A B 00 1

AB 01 1 1 1

AB 11

AB 10

∴ A BCD + ABC D + ABCD + ABCD = A DC + ABC + ABD

Example: Simplify the followings with K-Map:
f(A,B,C,D) = ∑ 𝑚(1,4,5,6,7)

= A B CD + ABC D + ABCD + ABC D + ABCD

CD CD CD CD CD
AB 00 01 11 10

A B 00 1

AB 01 1 1 1 1

AB 11

AB 10

∴ A B CD + ABC D + ABCD + ABC D + ABCD = AB + A C D