Boolean Algebra

Introduction

Boolean Operations

Important Boolean Laws and Rules

De Morgan's Theorems

Simplifying Boolean Expressions

Karnaugh Maps (K-Maps)

My Notes

Important Boolean Laws and Rules

---

Boolean algebra is a branch of algebra that deals with true or false values, typically represented as 1 (true) and 0 (false). It's used extensively in logic circuits, computer science, and digital electronics to model logical operations and decision-making.

Basic Elements of Boolean Algebra

1. Variables: These represent logical values and are typically denoted by letters like A, B, C, etc. Variables can take the value of either 1 (True) or 0 (False).

2. Constants: The two possible constant values in Boolean algebra are:

   • 1: Represents True.
   • 0: Represents False.

3. Logical Operations: There are three primary Boolean operations:

   • AND (⋅ or multiplication)
   • OR (+ or addition)
   • NOT (' or complement)

Boolean Operations

---

1. AND Operation

• Symbol: ⋅ or simply a juxtaposition (AB).

• Truth Table:

  A	B	A.B
  0	0	0
  0	1	0
  1	0	0
  1	1	1

• Explanation: The AND operation outputs 1 only when both inputs are 1.

2. OR Operation

• Symbol: +

• Truth Table:

  A	B	A+B
  0	0	0
  0	1	1
  1	0	1
  1	1	1

  
  

• Explanation: The OR operation outputs 1 if at least one input is 1.

3. NOT Operation

• Symbol: A' (also known as complement or negation).

• Truth Table:

  A	A’
  0	0
  1	0

• Explanation: The NOT operation inverts the input. If the input is 1, the output is 0, and vice versa.

Important Boolean Laws and Rules

---

1. Identity Laws

• A + 0 = A (OR with 0 has no effect)
• A ⋅ 1 = A (AND with 1 has no effect)

2. Null Laws

• A + 1 = 1 (OR with 1 always results in 1)
• A ⋅ 0 = 0 (AND with 0 always results in 0)

3. Idempotent Laws

• A + A = A
• A ⋅ A = A

4. Complement Laws

• A + A' = 1 (OR with the complement always results in 1)
• A ⋅ A' = 0 (AND with the complement always results in 0)

5. Double Negation Law

• (A')' = A (Taking the complement twice gives the original value)

6. Commutative Laws

• A + B = B + A (OR is commutative)
• A ⋅ B = B ⋅ A (AND is commutative)

7. Associative Laws

• A + (B + C) = (A + B) + C
• A ⋅ (B ⋅ C) = (A ⋅ B) ⋅ C

8. Distributive Laws

• A ⋅ (B + C) = (A ⋅ B) + (A ⋅ C)
• A + (B ⋅ C) = (A + B) ⋅ (A + C)

De Morgan's Theorems

---

These theorems are fundamental in Boolean algebra and digital logic design:

1. First De Morgan’s Theorem:

   • (A ⋅ B)' = A' + B'
   • Explanation: The complement of an AND operation is the same as the OR of the complements.

2. Second De Morgan’s Theorem:

   • (A + B)' = A' ⋅ B'
   • Explanation: The complement of an OR operation is the same as the AND of the complements.

Simplifying Boolean Expressions

---

Boolean expressions can often be simplified using the laws and rules mentioned above. The process helps reduce the complexity of logic circuits. Here’s an example:

Expression:
A + A ⋅ B

Simplification:
= A (1 + B) (Distributive Law)
= A ⋅ 1 (Null Law)
= A (Identity Law)

Karnaugh Maps (K-Maps)

---

Karnaugh Maps (K-Maps)

Karnaugh Maps are a visual method for simplifying Boolean expressions. They provide a systematic way to minimize logic functions without using Boolean algebra rules directly. Here’s a basic outline of how K-Maps work:

1. Organize variables in a grid format, typically 2x2 for two variables, 4x4 for four variables, and so on.
2. Plot the truth table of the Boolean expression into the grid.
3. Group adjacent 1s into as large a block as possible (groups of 1, 2, 4, 8, etc.).
4. Derive the simplified Boolean expression based on the grouping.

Example for 2-variable K-Map:

	B	B’
A’	0	1
A	1	0

My Notes

---

Simplifying Boolean Expressions

---

Boolean algebra is a branch of algebra that deals with true or false values, typically represented as