Scribd
Upload
47 views

Electronics, Digital Logic and Design: Dr. Irfan Uddin

This document summarizes Chapter 4 of a textbook on Boolean algebra and logic simplification. It includes figures and tables explaining concepts like commutative, associative, and distributive laws. It also covers DeMorgan's theorems, truth tables, Karnaugh maps, and examples of simplifying Boolean expressions into Sum of Products and Product of Sums forms. Homework examples are provided to help students practice applying these concepts.

Uploaded by

Abdul Rehman
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
47 views

Electronics, Digital Logic and Design: Dr. Irfan Uddin

This document summarizes Chapter 4 of a textbook on Boolean algebra and logic simplification. It includes figures and tables explaining concepts like commutative, associative, and distributive laws. It also covers DeMorgan's theorems, truth tables, Karnaugh maps, and examples of simplifying Boolean expressions into Sum of Products and Product of Sums forms. Homework examples are provided to help students practice applying these concepts.

Uploaded by

Abdul Rehman
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 73

Electronics, Digital Logic and

Design

Dr. Irfan Uddin


Digital Fundamentals
ELEVENTH EDITION

CHAPTER 4
Boolean Algebra
and Logic
Simplification
FIGURE 4-1
FIGURE 4-2
FIGURE 4-3 Application of commutative law of addition.
FIGURE 4-4 Application of commutative law of multiplication.
FIGURE 4-5 Application of associative law of addition.
FIGURE 4-6 Application of associative law of multiplication.
FIGURE 4-7 Application of distributive law.
TABLE 4–1 Basic rules of Boolean algebra.
FIGURE 4-8
FIGURE 4-9
FIGURE 4-10
FIGURE 4-11
FIGURE 4-12
FIGURE 4-13
FIGURE 4-14
FIGURE 4-15
FIGURE 4-16
TABLE 4–2 Rule 10: A + AB = A.
TABLE 4–3 Rule 11: A + ĀB = A + B.
TABLE 4–4 Rule 12: (A + B)(A + C) = A + BC.
FIGURE 4-17 Gate equivalencies and the corresponding truth tables that illustrate 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.
FIGURE 4-18 A combinational logic circuit showing the development of the Boolean expression for the output.
TABLE 4–5 Truth table for the logic circuit in Figure
4–18.
FIGURE 4-20 Gate circuits for Example 4–9.
Questions

• Example 4-9
• Example 4-10
• Example 4-11
FIGURE 4-22 Implementation of the SOP expression AB + BCD + AC.
FIGURE 4-24 Implementation of the POS expression (A + B)(B + C + D)(A + C).
FIGURE 4-25 A 3-variable Karnaugh map showing Boolean product terms for each cell.
FIGURE 4-26 A 4-variable Karnaugh map.
FIGURE 4–27 Adjacent cells on a Karnaugh map are those that differ by only one variable. Arrows point
between adjacent cells.
FIGURE 4-28 Example of mapping a standard SOP expression.
Grouping the 1s
Determining the Minimum SOP
expression from the Map
Home Work

• Example 4-27
• Example 4-28
• Example 4-29
FIGURE 4-39 Example of mapping directly from a truth table to a Karnaugh map.
FIGURE 4-43 Example of mapping a standard POS expression.
Home Work

• Example 4-32
• Example 4-33
Assignment # 4

• Solve all problems until section 4-10

You might also like