Digital Electronics-Lecture3-Boolean Algebra and logic Simplification[2025]
Digital Electronics-Lecture3-Boolean Algebra and logic Simplification[2025]
2
3
4
Chapter 2 [Complementary]
➢ SN: Texas Instruments
➢ DM: National Semiconductor
➢ HD: Hitachi
➢ MC: Motorola
6
Chapter 2 [Complementary]
➢ Task: design an alarm system for a 4-door house. The alarm will
sound when any one or all of the door-mounted push-button switches
are released (closed) by a door opening.
OUT = (A+B+C+D) 7
8
9
Boolean Algebra and logic
Simplification
➢ Key points:
- Logic variable, Logic expression, truth table, SOP
and POS,
- Truth table and standard forms.
- Boolean Algebra and Rules.
- Logic simplification using Boolean Algebra
- Karnaugh map (K map), simplification using K map.
10
Boolean Algebra and logic
Simplification
Boolean Addition
Example
Determine the values of A, B, and C that make the sum term
of the expression A + B + C = 0?
11
Boolean Algebra and logic
Simplification
Boolean Multiplication
12
Boolean Algebra and logic
Simplification
Commutative Laws
13
Boolean Algebra and logic
Simplification
Associative Laws
14
Boolean Algebra and logic
Simplification
Distributive Law
15
Boolean Algebra and logic
Simplification
Rules of Boolean Algebra
1. A + 0 = A 7. A . A = A
2. A + 1 = 1 8. A . A = 0
=
3. A . 0 = 0 9. A = A
4. A . 1 = A 10. A + AB = A
5. A + A = A 11. A + AB = A + B
6. A + A = 1 12. (A + B)(A + C) = A + BC
16
Boolean Algebra and logic
Simplification
Rules of Boolean Algebra
Rule 12, which states that (A + B)(A + C) = A + BC, can
be proven by applying earlier rules as follows:
(A + B)(A + C) = AA + AC + AB + BC
= A + AC + AB + BC
= A(1 + C + B) + BC
= A . 1 + BC
= A + BC
17
Example
Prove that A + AB = A
18
Boolean Algebra and logic
Simplification
DeMorgan’s Theorem
19
Boolean Algebra and logic
Simplification
DeMorgan’s Theorem
20
Boolean Algebra and logic
Simplification
DeMorgan’s Theorem
21
22
23
Boolean Algebra and logic
Simplification
Boolean Analysis of Logic Circuits
24
Boolean Algebra and logic
Simplification
SOP and POS forms
25
Boolean Algebra and logic
Simplification
SOP Standard form
Solution The first term does not include the variable C. Therefore,
multiply it by the (C + C), which = 1:
X = A B (C + C) + A B C
=ABC+ABC+ABC
26
Example
Standard SOP
27
Boolean Algebra and logic
Simplification
POS Standard form
Solution The first sum term does not include the variable C.
Therefore, add C C and expand the result by rule 12.
X = (A + B + C C)(A + B + C)
= (A +B + C )(A + B + C)(A + B + C)
28
Expression → Truth Table
29
30
Boolean Algebra and logic
Simplification
Karnaugh maps
The Karnaugh map (K-map) is a tool for simplifying
combinational logic with 3 or 4 variables. For 3 variables,
8 cells are required (23).
The map shown is for three variables
labeled A, B, and C. Each cell ABC ABC
represents one possible product
ABC ABC
term.
Each cell differs from an adjacent ABC ABC
cell by only one variable.
ABC ABC
31
Boolean Algebra and logic
Simplification
Karnaugh maps
Cells are usually labeled using 0’s and 1’s to represent the
variable and its complement.
C The numbers are entered in gray
AB 0 1
code, to force adjacent cells to be
00 different by only one variable.
32
Boolean Algebra and logic
Simplification
Karnaugh maps
AB ABC
AB ABC
ABC
33
Boolean Algebra and logic
Simplification
Karnaugh maps
K-maps can simplify combinational logic by grouping
cells and eliminating variables that change.
Example Group the 1’s on the map and read the minimum logic.
C 0 1 Solution
AB
1 1. Group the 1’s into two overlapping
00
B changes groups as indicated.
across this 01 1 1 2. Read each group by eliminating any
boundary variable that changes across a
11
boundary.
10 C changes
3. The vertical group is read AC.
across this 4. The horizontal group is read AB.
boundary
X = AC +AB
34
Boolean Algebra and logic
Simplification
Karnaugh maps
A 4-variable map has an adjacent cell on each of its four
boundaries as shown.
Each cell is different only by
CD CD CD CD
one variable from an adjacent
AB
cell.
AB Grouping follows the rules
AB
given in the text.
The following slide shows an
AB
example of reading a four
variable map using binary
numbers for the variables…
35
Boolean Algebra and logic
Simplification
Karnaugh maps
Example Group the 1’s on the map and read the minimum logic.
Solution
C changes across
outer boundary
CD
AB
00 01 11 10 1. Group the 1’s into two separate
00 1 1 groups as indicated.
B changes 2. Read each group by eliminating
01 1 1 any variable that changes across a
11 boundary.
1 1
B changes 3. The upper (yellow) group is read as
10 1 1 AD.
4. The lower (green) group is read as
C changes
AD.
X
X = AD +AD
36
Karnaugh Map Simplification of SOP
Expressions
37
Note that
38
39
40
41
X=
42
(b)
43
44
45
46
X= AB’C’+AB’C+ABC’+ABC
47
48
49
50
51
52
53
FIVE-VARIABLE KARNAUGH MAPS
54
55
56
Boolean Algebra and logic
Simplification
Hardware Description Languages (HDLs)
A Hardware Description Language (HDL) is a tool for
implementing a logic design in a PLD. One important
language is called VHDL. In VHDL, there are three
approaches to describing logic:
1. Structural Description is like a schematic
(components and block diagrams).
57
Boolean Algebra and logic
Simplification
Hardware Description Languages (HDLs)
A standard HDL is Verilog. In Verilog, the I/O and the logic is described
in one unit called a module. Verilog uses specific symbols to stand for
the Boolean logical operators.
The following is the same program as in the previous slide, written
for Verilog:
58
Selected Key Terms
59
Selected Key Terms
60
1. The associative law for addition is normally written as
a. A + B = B + A
b. (A + B) + C = A + (B + C)
c. AB = BA
d. A + AB = A
61
© 2008 Pearson Education
2. The Boolean equation AB + AC = A(B+ C) illustrates
a. the distribution law
b. the commutative law
c. the associative law
d. DeMorgan’s theorem
62
© 2008 Pearson Education
3. The Boolean expression A . 1 is equal to
a. A
b. B
c. 0
d. 1
63
© 2008 Pearson Education
4. The Boolean expression A + 1 is equal to
a. A
b. B
c. 0
d. 1
64
© 2008 Pearson Education
5. The Boolean equation AB + AC = A(B+ C) illustrates
a. the distribution law
b. the commutative law
c. the associative law
d. DeMorgan’s theorem
65
© 2008 Pearson Education
6. A Boolean expression that is in standard SOP form is
a. the minimum logic expression
b. contains only one product term
c. has every variable in the domain in every term
d. none of the above
66
© 2008 Pearson Education
7. Adjacent cells on a Karnaugh map differ from
each other by
a. one variable
b. two variables
c. three variables
d. answer depends on the size of the map
67
© 2008 Pearson Education
8. The minimum expression that can be read from
the Karnaugh map shown is
C C
a. X = A
AB
b. X = A AB
c. X = B AB 1 1
d. X = B AB 1 1
68
© 2008 Pearson Education
9. The minimum expression that can be read from
the Karnaugh map shown is
C C
a. X = A
AB 1 1
b. X = A AB
c. X = B AB
d. X = B AB 1 1
69
© 2008 Pearson Education
Answers:
1. b 6. c
2. c 7. a
3. a 8. a
4. d 9. d
5. a
70