Boolean Algebra

Boolean Algebra is a mathematical system for analyzing and simplifying digital logic circuits. It is named after George Boole, who developed a formal system to work with binary variables (0 and 1).

Boolean algebra uses operators like AND, OR, and NOT to represent logical relationships. It is essential for designing simpler and efficient digital circuits.

---

Basic Concepts

1. Variables:
   • Represent logic levels:
     • 1 = TRUE / HIGH
     • 0 = FALSE / LOW
   • Example: A, B, C
2. Operators:

Operator	Symbol	Meaning
AND	· or AB	Output 1 if both inputs are 1
OR	+	Output 1 if any input is 1
NOT	’	Output is complement of input

• Example:
  • A = 1, B = 0
  • A·B = 1·0 = 0 (AND)
  • A + B = 1 + 0 = 1 (OR)
  • A’ = 0 (NOT)

---

Boolean Laws & Rules

These are fundamental identities used to simplify expressions:

1. Commutative Law:
   • A + B = B + A
   • A·B = B·A
2. Associative Law:
   • (A + B) + C = A + (B + C)
   • (A·B)·C = A·(B·C)
3. Distributive Law:
   • A·(B + C) = A·B + A·C
   • A + (B·C) = (A + B)·(A + C)
4. Identity Law:
   • A + 0 = A
   • A·1 = A
5. Null Law:
   • A + 1 = 1
   • A·0 = 0
6. Complement Law:
   • A + A’ = 1
   • A·A’ = 0
7. Idempotent Law:
   • A + A = A
   • A·A = A
8. Involution Law:
   • (A’)’ = A

---

De Morgan’s Theorems

These are critical for logic simplification and circuit design:

1. The complement of AND:
   $(A·B)’ = A’ + B’$(A⋅B)’=A’+B’
2. The complement of OR:
   $(A + B)’ = A’·B’$(A+B)’=A’⋅B’

Example:

• A = 1, B = 0
• LHS: (A·B)’ = (1·0)’ = 0’ = 1
• RHS: A’ + B’ = 0 + 1 = 1 ✅

Usage:

• Helps convert AND-OR circuits into NAND-NAND circuits (or OR-AND into NOR-NOR), which are cheaper and faster to implement.

---

Simplification of Boolean Expressions

Steps for simplification:

1. Write down the original Boolean expression.
   • Example: Y = A·B + A·B’
2. Apply Boolean laws:
   • Y = A·(B + B’) → Using Distributive Law
   • Y = A·1 → Using Complement Law (B + B’ = 1)
   • Y = A → Simplified
3. Draw circuit diagram using the simplified expression → saves gates and power.

---

Practical Applications of Boolean Algebra

1. Digital Circuit Design:
   • Reduces complexity → fewer gates → faster circuits
   • Example: designing adders, multiplexers, decoders
2. Error Detection and Correction:
   • Boolean expressions used in parity checks, checksums
3. Control Systems:
   • Logic expressions decide actions (e.g., start/stop, traffic lights)
4. Computer Programming:
   • Conditional statements, bitwise operations use Boolean algebra

---

Example Problem

Problem: Simplify Y = A·B + A·B’ + A’·B

Solution:

1. Y = A·(B + B’) + A’·B → Distributive Law
2. Y = A·1 + A’·B → Complement Law
3. Y = A + A’·B → Identity Law
4. Y = (A + A’)·(A + B) → Distributive Law
5. Y = 1·(A + B) → Complement Law
6. Y = A + B ✅ Simplified expression

---

💡 Key Point:

• Simplification saves cost, power, and space in real digital hardware design.
• Boolean algebra + De Morgan’s theorems → critical for designing efficient circuits.