Chapter 4
Boolean Algebra and Theorems, Minterms and Maxterms
OBJECTIVE
In Chapter 3, we discussed binary signed, unsigned and signed magnitude numbers and binary arithmetic operations. In this chapter, we shall learn logic operations and the concept of truth table. We shall learn Boolean algebraic laws and theorems. Topics such as sum of products (SOPs) and product of sums (POSs) and minterms and maxterms will also be studied.
Six digital-electronics logic-gates are used as basic element in a simple as well as complex circuit. These are NOT, NAND, AND, OR, NOR and XOR. An interesting combination is NOT-XOR.
4.1 THE NOT, AND, OR LOGIC OPERATIONS
Figure 4.1 gives the logic symbols as well as the truth tables of NOT, NAND, AND, OR gates.
Get Digital Systems now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
