Boolean Algebra Notes (2)

Boolean Algebra Notes
Based on Morris Mano's "Digital Logic and Computer Design"

Organaized By Evan.
1. Basic Definitions
Boolean Variable: A variable that takes only two values: 1 (True) or 0 (False).
Boolean Operations:
AND (⋅): Output is 1 if all inputs are 1.
OR (+): Output is 1 if at least one input is 1.
NOT (overline or complement): Inverts the input (1 → 0, 0 → 1).
2. Basic Laws of Boolean Algebra

1. Identity Laws:
A+0=A
A⋅1=A
2. Null Laws:
A+1=1
A⋅0=0
3. Idempotent Laws:
A+A=A
A⋅A=A
4. Complement Laws:
A + A' = 1
A ⋅ A' = 0
5. Double Complement:
A'' = A
3. Commutative, Associative, and Distributive Laws

1. Commutative Laws:
A+B=B+A
A⋅B=B⋅A
2. Associative Laws:
(A + B) + C = A + (B + C)
(A ⋅ B) ⋅ C = A ⋅ (B ⋅ C)
3. Distributive Laws:
A ⋅ (B + C) = (A ⋅ B) + (A ⋅ C)
A + (B ⋅ C) = (A + B) ⋅ (A + C)
4. DeMorgan's Theorems
1. First Theorem: (A ⋅ B)' = A' + B'
2. Second Theorem: (A + B)' = A' ⋅ B'
5. Standard Forms of Boolean Expressions

1. Sum of Products (SOP):
ORed terms of ANDed variables.
Example: A ⋅ B + A' ⋅ C
2. Product of Sums (POS):
ANDed terms of ORed variables.
Example: (A + B') ⋅ (B + C')
6. Simplification of Boolean Functions

1. Karnaugh Maps (K-Maps):
Visual tool to simplify Boolean expressions.
Group 1s into rectangles of size 1, 2, 4, 8, etc.
Write the simplified expression for each group.
2. Algebraic Simplification:
Apply Boolean laws to reduce complexity.
7. Logic Gates (Physical Realization)

1. AND Gate: Output is 1 if all inputs are 1.
2. OR Gate: Output is 1 if at least one input is 1.
3. NOT Gate: Inverts the input.
4. NAND Gate: Complement of AND.
5. NOR Gate: Complement of OR.
6. XOR Gate: Output is 1 if inputs differ.
7. XNOR Gate: Complement of XOR.
8. Canonical and Standard Forms

1. Canonical Sum of Products (Canonical SOP):
Write minterms where the function is 1.
Example: F(A, B) = Σ(1, 2, 3).
2. Canonical Product of Sums (Canonical POS):
Write maxterms where the function is 0.
Example: F(A, B) = Π(0, 2).
9. Important Properties
Absorption Law:
A+A⋅B=A
A ⋅ (A + B) = A
Consensus Theorem:
A ⋅ B + A' ⋅ C + B ⋅ C = A ⋅ B + A' ⋅ C
Involution Law:
A'' = A
10. Truth Tables

A truth table lists all possible input combinations and their corresponding output.
A B A+B A⋅B A'
0 0 0 0 1
0 1 1 0 1
1 0 1 0 0
1 1 1 1 0
11. Boolean Algebra Applications

1. Simplification of Circuits:
Reduce the number of gates and inputs in a circuit.
2. Design of Logical Circuits:
Use SOP or POS forms to design logic circuits.
3. Error Detection and Correction:
Boolean functions are used in parity checks.
Some Common Problems
1. Simplify Boolean Expressions

Simplify the following Boolean expressions using Boolean laws:
1. A+A⋅B
2. A ⋅ (B + C) + A ⋅ B
3. (A + B)(A + C)
4. A ⋅ B + A ⋅ B'
5. (A + B)(A' + C)
6.
2. Truth Table Construction
Construct the truth table for the following Boolean expressions:
7. F(A, B) = A ⋅ B + A' ⋅ B'
8. F(A, B, C) = (A + B) ⋅ C
9. F(A, B, C) = A ⋅ B + B ⋅ C + C ⋅ A
10. F(A, B, C) = (A + B') ⋅ (B + C')
11.
3. Solve Using Karnaugh Maps
Simplify the following Boolean functions using Karnaugh Maps (K-Maps):

12. F(A, B, C) = Σ(1, 3, 5, 7)
(Sum of minterms)
13. F(A, B, C, D) = Σ(1, 3, 7, 11, 15)
(Sum of minterms)
14. F(A, B, C, D) = Π(0, 2, 4, 6, 8)
(Product of maxterms)
4. Circuit Design
15. Design a circuit for the SOP function:
F(A, B, C) = A ⋅ B + A' ⋅ C
16. Design a circuit for the POS function:
F(A, B) = (A + B')(A' + B)
17. Design a circuit for the XOR function:
F(A, B) = A ⊕ B = A' ⋅ B + A ⋅ B'
5. DeMorgan's Theorem
Use DeMorgan's Theorems to simplify the following expressions:
18. (A ⋅ B)'
19. (A + B + C)'
20. ((A + B) ⋅ C)'
6. Verification Problems
Verify the equivalence of the following Boolean expressions using truth tables or Boolean
laws:
21. A + A' ⋅ B = A + B
22. A ⋅ (A' + B) = A ⋅ B
23. (A + B)(A + C) = A + B ⋅ C
7. Real-life Application
Suppose you have a security system with the following rules:
Alarm (A) is triggered if:
Motion is detected (M) AND the door is open (D), OR
The window is broken (W).
Write the Boolean expression for the alarm (A), simplify it, and draw the circuit diagram.
8. Miscellaneous
24. Find the complement of the function:
F(A, B, C) = A ⋅ B + A ⋅ C + B ⋅ C
25. Prove the Consensus Theorem:
A ⋅ B + A' ⋅ C + B ⋅ C = A ⋅ B + A' ⋅ C
26. Determine the canonical forms (SOP and POS) for:
F(A, B, C) = A ⋅ B + B ⋅ C

Boolean Algebra Notes (2)

Uploaded by

Boolean Algebra Notes (2)

Uploaded by

Boolean Algebra Notes

Based on Morris Mano's "Digital Logic and Computer Design"

2. Basic Laws of Boolean Algebra

3. Commutative, Associative, and Distributive Laws

5. Standard Forms of Boolean Expressions

6. Simplification of Boolean Functions

7. Logic Gates (Physical Realization)

8. Canonical and Standard Forms

10. Truth Tables

A B A+B A⋅B A'

11. Boolean Algebra Applications

Some Common Problems

1. Simplify Boolean Expressions

Simplify the following Boolean functions using Karnaugh Maps (K-Maps):

You might also like