Boolean Algebra and Logic Simplification 1
BOOLEAN OPERATIONS AND EXPRESSIONS ï‚¢
Boolean Addition (OR)
2
3
ï‚¢Boolean
Multiplication (AND)
4
5
LAWS AND RULES OF BOOLEAN ALGEBRA Laws:
Commutative Associative Distributive Rules
6
APPLICATION OF COMMUTATIVE LAW OF ADDITION. 7
APPLICATION OF COMMUTATIVE LAW OF MULTIPLICATION. 8
APPLICATION OF ASSOCIATIVE LAW OF ADDITION 9
APPLICATION OF ASSOCIATIVE LAW OF MULTIPLICATION 10
APPLICATION OF DISTRIBUTIVE LAW 11
RULES OF BOOLEAN ALGEBRA
12
RULE 1 13
RULE 2 14
RULE 3 15
RULE 4
16
RULE 5 17
RULE 6 18
RULE 7 19
RULE 8 20
RULE 9
21
22
23
24
DEMORGAN’S THEOREM
Gate equivalencies and the corresponding truth tables that illustrate 25 DeMorgan’s theorems. Notice the equality of the two output columns in each table. This shows that the equivalent gates perform the same logic function.
26
27
BOOLEAN EXPRESSION FOR A LOGIC CIRCUIT
A logic circuit showing the development of the Boolean expression for the output. 28
CONSTRUCTING A TRUTH TABLE FOR A LOGIC CIRCUIT ï‚¢ Evaluating
the expression and putting results in truth table format
29
SIMPLIFICATION USING BOOLEAN ALGEBRA
30
GATE CIRCUITS FOR EXAMPLE 4-8 31
STANDARD FORMS OF BOOLEAN EXPRESSIONS Sum-of-Products
(SOP) Form
• Product-of-Sum (POS) Form
32
SOP FORM
Implementation of the SOP expression AB + BCD + AC.
33
34
STANDARD SOP FORM
35
BINARY REPRESENTATION OF PRODUCT TERM
36
37
POS Form
IMPLEMENTATION OF THE POS EXPRESSION (A + B)(B + C + D) (A + C).
38
STANDARD POS FORM
39
BINARY REPRESENTATION OF SUM TERM
40
CONVERTING STANDARD SOP TO STANDARD POS
41
CONVERTING SOP TO TRUTH TABLE
42
CONVERTING POS TO TRUTH TABLE
43
DETERMINING STANDARD EXPRESSIONS FROM TRUTH TABLE
44
45
Karnaugh Map
A 3-VARIABLE KARNAUGH
MAP SHOWING PRODUCT TERMS.
46
A 4-VARIABLE KARNAUGH MAP. 47
ADJACENT
CELLS ON A KARNAUGH MAP ARE THOSE THAT DIFFER BY ONLY ONE VARIABLE. ARROWS POINT BETWEEN ADJACENT CELLS.
48
Karnaugh Map SOP Minimization
EXAMPLE OF MAPPING
A STANDARD
SOP EXPRESSION.
49
50
51
MAPPING NONSTANDARD SOP EXPRESSION
52
53
54
55
KARNOUGH MAP SIMPLIFICATION OF SOP EXPRESSIONS Example 4-25 Group the 1s in each Karnaugh maps
56
57
DETERMINE SOP
Related Problem: add 1 in the lower right cell (1010) and determine the resulting SOP.
58
Related Problem: For the Karnaugh map in Fig. 4-31(d), add 1 in the 0111 cell and determine the resulting SOP. 59
101+011+001+000+100
60
61
MAPPING DIRECTLY FROM TRUTH TABLE
Example of mapping directly from a truth table to a Karnaugh map.
62
“DON’T CARE” CONDITIONS
63
Example of the use of “don’t care” conditions to simplify an expression.
KARNAUGH MAP POS MINIMIZATION
Example of mapping a standard POS expression.
64
Example 4-30
65
66
67
68
69
CONVERTING B/W POS AND SOP USING KARNAUGH MAP
70
FIVE-VARIABLE KARNAUGH MAPS
A 5-variable Karnaugh map. 71
ILLUSTRATION OF GROUPINGS OF 1S IN ADJACENT CELLS OF A 5-VARIABLE MAP.
72
73
Programmable Logic
BASIC STRUCTURE OF A PAL.
74
PAL IMPLEMENTATION OF A SUM-OFPRODUCTS EXPRESSION.
75
Digital System Application
SEVEN-SEGMENT DISPLAY FORMAT SHOWING ARRANGEMENT OF SEGMENTS.
76
DISPLAY OF DECIMAL DIGITS WITH A 7-SEGMENT DEVICE. 77
ARRANGEMENTS OF 7-SEGMENT LED DISPLAYS.
78
BLOCK DIAGRAM OF 7-SEGMENT LOGIC AND DISPLAY.
79
KARNAUGH MAP MINIMIZATION OF THE SEGMENT-A LOGIC EXPRESSION.
80
THE MINIMUM LOGIC IMPLEMENTATION FOR SEGMENT A OF THE 7-SEGMENT DISPLAY.
81