Scribd
Upload
7 views37 pages

Chapter 3

The document focuses on Boolean algebra and logic simplification in digital logic design, detailing DeMorgan's Theorems and Karnaugh Maps (K-maps) for simplifying Boolean functions. It includes examples for two, three, and four-variable K-maps, as well as a discussion on 'Don't-care Combinations' which are input conditions that do not occur in normal operation. The author, Dagnachew M., provides a comprehensive overview of these concepts to aid in the understanding of digital logic design.

Uploaded by

dagnachewmulu4
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
7 views37 pages

Chapter 3

The document focuses on Boolean algebra and logic simplification in digital logic design, detailing DeMorgan's Theorems and Karnaugh Maps (K-maps) for simplifying Boolean functions. It includes examples for two, three, and four-variable K-maps, as well as a discussion on 'Don't-care Combinations' which are input conditions that do not occur in normal operation. The author, Dagnachew M., provides a comprehensive overview of these concepts to aid in the understanding of digital logic design.

Uploaded by

dagnachewmulu4
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

Digital Logic Design

CHAPTER-THREE

Boolean algebra and Logic


Simplification
by
Dagnachew M.
3-1 Itroduction

By Dagnachew M.
2
By Dagnachew M.
3
By Dagnachew M.
4
DeMorgan’s Theorem
5
DeMorgan's Theorems I

XYZ = X + Y + Z

WXYZ = W + X + Y + Z

DeMorgan's Theorem II

X + Y + Z = XYZ

W + X + Y + Z = WXYZ

By Dagnachew M. 5
By Dagnachew M. 6
By Dagnachew M.
7
By Dagnachew M.
8
By Dagnachew M.
9
By Dagnachew M.
10
By Dagnachew M.

11
By Dagnachew M.
12
By Dagnachew M.
13
By Dagnachew M.
14
By Dagnachew M. 15
By Dagnachew M.
16
Karnaugh Maps(K-maps )

By Dagnachew M.

17
By Dagnachew M.
18
Karnaugh Maps(K-maps )

By Dagnachew M.
19
Karnaugh Maps(K-maps )…..

By Dagnachew M.
20
Tow variable K-maps …
two-variable system can form four minterms, the map consists of
four cells one for each minterm.

By Dagnachew M.
21
Three-Variable K- Maps

By Dagnachew M.
22
Three-Variable K- Maps….

By Dagnachew M.
23
Example 1
. Simplify the Boolean function

Answer

By Dagnachew M.
24
Example 2

xample 3

By Dagnachew M.
25
Example 4
Example

By Dagnachew M.
26
Four -Variable K- Maps

By Dagnachew M.
27
Four -Variable K- Maps…

By Dagnachew M.
28
Example 5
Example

29
By Dagnachew M.
Example 6
.

By Dagnachew M.
30
Example 7

By Dagnachew M.
31
Example 8

By Dagnachew M.
32
Example 9

By Dagnachew M.
33
Example 10

By Dagnachew M.
34
Don’t-care Combinations
➢ In certain digital systems, some input combinations never
occur during the process of anormal operation because
those input conditions are guaranteed never to occur.
➢ Such input combinations are called Don’t-Care
Combinations.
➢ The function output may be either 1 or 0 and these
functions are called incompletely specified functions.
➢ These input combinations can be plotted on the Karnaugh
map for further simplification of the function.
➢ The don’tcare combinations are represented by d or x or Φ.
By Dagnachew M.
35
Example 11

By Dagnachew M.
36
By Dagnachew M.
37

You might also like