0% found this document useful (0 votes)
18 views15 pages

Sheet 2 Solution DLDDDD123

The document provides a series of problems and solutions related to digital logic design, specifically focusing on the simplification of Boolean functions using Karnaugh maps (K-maps). It includes various functions expressed in both sum of products and product of sums forms, along with their respective simplified expressions and implementations using digital logic gates. The problems cover multiple variables and demonstrate the application of K-maps in simplifying complex logic expressions.

Uploaded by

Mena Adel
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
0% found this document useful (0 votes)
18 views15 pages

Sheet 2 Solution DLDDDD123

The document provides a series of problems and solutions related to digital logic design, specifically focusing on the simplification of Boolean functions using Karnaugh maps (K-maps). It includes various functions expressed in both sum of products and product of sums forms, along with their respective simplified expressions and implementations using digital logic gates. The problems cover multiple variables and demonstrate the application of K-maps in simplifying complex logic expressions.

Uploaded by

Mena Adel
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/ 15

Information and Engineering Technology Faculty

Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps
Problem 1: Implement the following function using digital logic gates after simplifying it in

𝐹(𝐴, 𝐵, 𝐶) = 𝛴𝑚(0, 2, 3, 4, 6)
a) Sum of products.

Solution:
B
BC
A 1 1 1

1 1
A

𝑭 = 𝑪′ + 𝑨′ 𝑩

b) Product of sums:

Solution: B’
BC
A 0

0 0
A’

C’

𝑭 = (𝑨′ + 𝑪′). (𝑪′ + 𝑩)


Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps
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)

Solution:

CD
AB 00 01 11 10
1 1 1
00
1 1
01
1 1
11
1 1 1
10

𝑭 = 𝑪𝑫 + 𝑨𝑪 + 𝐴′ 𝐵𝐷 + 𝐵′ 𝐷′
C
D
A
C F
A’
B
D
B’
D’
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps
b) 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = 𝛱𝑀(2, 3, 12, 13, 14, 15)

Solution:

CD
AB 00 01 11 10
1 1
00
1 1 1 1
01

11
1 1 1 1

10

𝑭 = 𝑨′𝑪′ + 𝑨′𝑩 + 𝐴𝐵′

A’
C’
A’ F
B
A
B’
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps
Problem 3: Simplify the following Boolean expressions using K–maps and implement them using digital
logic gates

a) 𝐹(𝐴, 𝐵, 𝐶) = 𝐴 𝐵′ 𝐶 + 𝐵′ 𝐶′ + 𝐵 𝐶 + 𝐴 𝐵 + 𝐴′ 𝐵 𝐶′

Solution:

BC
00 01 11 10
A
1 1 1
0

1 1 1 1
1

𝑭 = 𝑪′ + 𝑨 + 𝑩
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps

b) 𝐹(𝑤, 𝑥, 𝑦, 𝑧) = 𝑤′ 𝑧 + 𝑥 𝑧 + 𝑥′ 𝑦 + 𝑤 𝑥′ 𝑧

Solution:

YZ
WX 00 01 11 10
1 1 1
00
1 1
01
1 1
11
1 1 1

10

𝑭 = 𝒁 + 𝑿′𝒀

X’ F
Y
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps

c) 𝐹 ′ (𝐴, 𝐵, 𝐶, 𝐷) = 𝐴 𝐵′ 𝐶 + 𝐵′ 𝐶 ′ 𝐷 ′ + 𝐵 𝐶 𝐷 + 𝐴 𝐶 𝐷 ′ + 𝐴′ 𝐵′ 𝐶 + 𝐴′ 𝐵 𝐶 ′ 𝐷

Solution:

CD 00 01 11 10
AB
00 0 1 0 0

1 0 0 1
01
1 1 0 0
11
0 1 0 0
10

𝑭 = 𝑨′ 𝑩𝑫′ + 𝑨𝑩𝑪′ + 𝑩′𝑪′𝑫

A
B
C’
A’
B F
D’
B’
C’
D
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps
d) 𝐹 ′ (𝐴, 𝐵, 𝐶, 𝐷) = (𝐴 + 𝐵 + 𝐶). (𝐴′ + 𝐷). (𝐵 + 𝐶 ′ + 𝐷). (𝐴 + 𝐵 + 𝐶 ′ + 𝐷 ′ )

Solution:

Since F’ is represented in POS we can get F in SOP by complementing both sides as follows:

𝐹 ′ = ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅̅̅ (𝐴 + 𝐵 + 𝐶). (𝐴′ + 𝐷′). (𝐵 + 𝐶 ′ + 𝐷). (𝐴 + 𝐵 + 𝐶 ′ + 𝐷 ′ )

Using Demorgan’s Law:


𝐹 = 𝐴′ 𝐵′ 𝐶 ′ + 𝐴𝐷 + 𝐵′ 𝐶𝐷 ′ + 𝐴′𝐵′𝐶𝐷

CD
AB 00 01 11 10
1 1 1 1
00

01
1 1
11
1 1 1
10

𝑭 = 𝑨𝑫 + 𝑩′𝑪 + 𝑨′𝑩′

B’
C
A
D F

A’
B’
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps
Problem 4: Simplify the following Boolean expressions using K–maps and implement them using digital
logic gates

a) 𝐹(𝑥, 𝑦, 𝑧) = 𝛴(0, 1, 2, 4, 5) 𝑎𝑛𝑑 𝑑(3, 6, 7)

Solution:

𝑦𝑧
𝑥 1 1 X 1

1 1 X X

𝑭=𝟏

1 F
b) 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = 𝛴(0, 6, 8, 13, 14) 𝑎𝑛𝑑 𝑑(𝐴, 𝐵, 𝐶, 𝐷) = 𝛴(2, 4, 10)

Solution:

CD
AB 00 01 11 10
1 X
00
X 1
01
1 1
11
1 X

10
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps
𝑭 = 𝑪𝑫′ + 𝑩′ 𝑫′ + 𝑨𝑩𝑪′𝑫

C
D’
B’ F
D’

A
B
C’
D
c) 𝐹(𝑤, 𝑥, 𝑦, 𝑧) = 𝛴(1, 3, 5, 7, 9, 15) 𝑎𝑛𝑑 𝑑(𝐴, 𝐵, 𝐶, 𝐷) = 𝛴(4, 6, 12, 13)

Solution:

YZ
WX 00 01 11 10
1 1
00
X 1 1 X
01
X X 1
11
1
10
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps

𝑭 = 𝑾′𝒁 + 𝑿𝒁 + 𝒀′𝒁

X
Z
Y’ F
Z
W’
Z
Problem 5: Using K–maps, find in the simplest form the sum of products of the function 𝐹 = 𝑡 · 𝑔, where
t and g are expressed as follows:
𝑡 = 𝑤 𝑥 𝑦′ + 𝑦′ 𝑧 + 𝑤′ 𝑦 𝑧′ + 𝑥′ 𝑦 𝑧′

𝑔 = (𝑤 + 𝑥 + 𝑦′ + 𝑧′) (𝑥′ + 𝑦′ + 𝑧) (𝑤′ + 𝑦 + 𝑧)


Solution:
𝑡 = 𝑤 𝑥 𝑦′ + 𝑦′ 𝑧 + 𝑤′ 𝑦 𝑧′ + 𝑥′ 𝑦 𝑧′

YZ
WX 00 01 11 10
1 1
00
1 1
01
1 1
11
1 1

10
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps
𝑔 = (𝑤 + 𝑥 + 𝑦′ + 𝑧′) (𝑥′ + 𝑦′ + 𝑧) (𝑤′ + 𝑦 + 𝑧)

YZ
WX 00 01 11 10
1 1 0 1
00
1 1 1 0
01
0 1 1 0
11
0 1 1 1

10

𝐹 = 𝑡 ·𝑔

YZ
WX 00 01 11 10
1 1
00
1
01
1
11
1 1

10

𝑭 = 𝒀′𝒁 + 𝑿′𝒀𝒁′
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps

Problem 6: Simplify function Z using K-maps only:

𝑍 = 𝐹 + 𝐺𝐻 ′

𝐹 = (𝐴 + 𝐵 + 𝐶 + 𝐷)′ + 𝐴𝐵 ′ + 𝐴′ 𝐶𝐷′ + 𝐴′ 𝐵 ′ 𝐶𝐷 + 𝐴′𝐵𝐶𝐷

𝐺 = 𝐴′ 𝐵 + 𝐶𝐷 + 𝐴𝐵 ′ 𝐶𝐷′ + 𝐴𝐵 ′ 𝐶𝐷

𝐻′ = 𝐴′ 𝐵𝐶 + 𝐴′ 𝐵′ + 𝐴′𝐶′
Solution:

Using Demorgan’s law:

𝐹 = 𝐴′𝐵′𝐶′𝐷′ + 𝐴𝐵′ + 𝐴′ 𝐶𝐷 ′ + 𝐴′ 𝐵′ 𝐶𝐷 + 𝐴′𝐵𝐶𝐷

CD
AB 00 01 11 10
1 1 1
00
1 1
01

11
1 1 1 1

10
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps

𝐺 = 𝐴′ 𝐵 + 𝐶𝐷 + 𝐴𝐵′ 𝐶𝐷′ + 𝐴𝐵′ 𝐶𝐷

CD
AB 00 01 11 10
1
00
1 1 1 1
01
1
11
1 1

10

𝐻′ = 𝐴′ 𝐵𝐶 + 𝐴′ 𝐵′ + 𝐴′𝐶′

CD
AB 00 01 11 10
0 0 0 0
00
0 0 0 0
01
1 1 1 1
11
1 1 1 1

10
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps
𝐺. 𝐻′
CD
AB 00 01 11 10

00

01
1
11
1
10

𝑍 = 𝐹 + 𝐺𝐻 ′
CD
AB 00 01 11 10
1 1 1
00
1 1
01
1
11
1 1 1 1

10

𝑭 = 𝑨′ 𝑪 + 𝑩′ 𝑫′ + 𝑨′𝑩 + 𝑪𝑫
Information and Engineering Technology Faculty
Prof. Tallal El-Shabrawy, Dr. Wassim Alexan & Dr. Minar El-Aassar

ELCT201 Digital Logic Design - Spring 2023 Sheet 2


K-maps

Problem 7: Write down the logic functions for each of the following circuits:

You might also like