©2004 Brooks/Cole

FIGURES FOR

CHAPTER 4

APPLICATIONS OF BOOLEAN ALGEBRAMINTERM AND MAXTERM EXPANSIONS

Click the mouse to move to the next page.Use the ESC key to exit this chapter.

This chapter in the book includes:ObjectivesStudy Guide

4.1 Conversion of English Sentences to Boolean Equations4.2 Combinational Logic Design Using a Truth Table4.3 Minterm and Maxterm Expansions4.4 General Minterm and Maxterm Expansions4.5 Incompletely Specified Functions4.6 Examples of Truth Table Construction4.7 Design of Binary Adders and Subtractors

Problems

©2004 Brooks/Cole

Section 4.1, p. 85

©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

Minterm Expansion (p. 89)

(4-9)

(4-10)

©2004 Brooks/Cole

f = a'(b'+d) + acd'

Maxterm Expansion (p. 90)

(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 ofFour 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