Basics of Boolean Algebra
Basics of Boolean Algebra
CHAPTER 4
APPLICATIONS OF BOOLEAN ALGEBRA
MINTERM AND MAXTERM EXPANSIONS
This chapter in the book includes:
Objectives
Study Guide
4.1 Conversion of English Sentences to Boolean Equations
4.2 Combinational Logic Design Using a Truth Table
4.3 Minterm and Maxterm Expansions
4.4 General Minterm and Maxterm Expansions
4.5 Incompletely Specified Functions
4.6 Examples of Truth Table Construction
4.7 Design of Binary Adders and Subtractors
Problems
©2004 Brooks/Cole
Figure 4-1:Combinational Circuit
with Truth Table
©2004 Brooks/Cole
Section 4.2, p. 86
©2004 Brooks/Cole
Table 4-1 Minterms and Maxtems
for Three Variables
©2004 Brooks/Cole
(4-9)
(4-10)
©2004 Brooks/Cole
f = a'(b'+d) + acd'
(4-11)
©2004 Brooks/Cole
Table 4-2. General Truth Table for Three Variables
©2004 Brooks/Cole
Table 4-3. Conversion of Forms
©2004 Brooks/Cole
Table 4-4. Application of Table 4-3
©2004 Brooks/Cole
Section 4.5, p. 93
©2004 Brooks/Cole
Table 4-5. Truth Table with Don't Cares
©2004 Brooks/Cole
Section 4.6, p. 95
©2004 Brooks/Cole
Section 4.6, p. 95
©2004 Brooks/Cole
Figure 4-2: Parallel Adder for 4-Bit Binary Numbers
©2004 Brooks/Cole
Figure 4-3: Parallel Adder Composed of
Four Full Adders
©2004 Brooks/Cole
Figure 4-4: Truth Table for a Full Adder
©2004 Brooks/Cole
Figure 4-5: Implementation of Full Adder
©2004 Brooks/Cole
Figure 4-6: Binary Subtracter Using Full Adders
©2004 Brooks/Cole
Figure 4-7: Parallel Subtracter
©2004 Brooks/Cole
Table 4.6. Truth Table for Binary Full Subtracter
©2004 Brooks/Cole