What is Boolean Algebra?
Boolean algebra is a branch of mathematics where variables only have two possible values: 0 (false) and 1 (true). It was invented by George Boole in 1847 — nearly a century before computers existed — and later applied to digital circuits by Claude Shannon in 1937.
The practical value is enormous: with Boolean algebra, you can take a complex multi-gate circuit and prove it's equivalent to a much simpler one, saving transistors, power, and money.
The Three Basic Operations
- AND (·) — multiplication analog: A · B = 1 only when both are 1
- OR (+) — addition analog: A + B = 0 only when both are 0
- NOT (‾) — complement: Ā = 1 when A = 0, and vice versa
Notation warning: In Boolean algebra, + means OR (not arithmetic addition) and · means AND (often omitted, so AB = A AND B). Context matters!
The Laws of Boolean Algebra
These identities are always true and form the toolkit for simplification:
A · 1 = A
A · 0 = 0
A · A = A
A · Ā = 0
A · B = B · A
(AB)C = A(BC)
A+BC = (A+B)(A+C)
A(A + B) = A
De Morgan's Theorems
These two theorems are perhaps the most important tools in circuit design. They let you convert AND into OR (and vice versa) while distributing a NOT:
Theorem 1: NOT(A AND B) = NOT A OR NOT B
¬(A · B) = Ā + B̄
Theorem 2: NOT(A OR B) = NOT A AND NOT B
¬(A + B) = Ā · B̄
In plain English: "Break the bar, change the operation."
Practical use: NAND and NOR gates naturally implement De Morgan equivalences. Replacing AND+NOT with a single NAND gate reduces component count — De Morgan tells you it's safe to do so.
Simplification Walkthrough
Let's simplify: F = AB + AB̄ step by step.
📝 Step-by-step simplification
A two-gate circuit (AND + OR) reduces to a single wire. This is the power of algebra.
Karnaugh Maps (K-Maps)
Karnaugh maps are a visual method for simplifying Boolean expressions. Minterms (1s) that are physically adjacent on the map can be grouped and eliminated. The larger the group, the more variables cancel out.
2-variable K-Map for F = AB + ĀB + AB̄
The three 1s can be grouped: pair AB+AB̄ (row A=1) simplifies to A; pair ĀB+AB (column B=1) simplifies to B. Combined: F = A + B.
K-Map grouping rules
- Groups must contain 1, 2, 4, 8, 16… cells (powers of 2)
- Groups must be rectangular and can wrap around edges
- Make groups as large as possible
- Every 1 must be covered by at least one group
- Each variable that changes across the group cancels out
Check Your Understanding
Test your Boolean algebra skills — select the correct simplified expression for each question.