Logic Gate Truth Tables

Why This Matters

Logic gates are the fundamental building blocks of every digital system, from simple circuits to complex processors. Understanding them goes beyond memorizing which input combinations produce which outputs. You need to grasp the underlying Boolean algebra principles, gate universality, and how gates combine to perform logical operations. These concepts form the foundation for circuit simplification, combinational logic design, and eventually sequential logic.

The truth tables encode the logical behavior that makes digital electronics predictable and designable. Understanding the relationships between gates lets you analyze circuits quickly and choose the right gate for any application. Don't just memorize the tables; know why each gate behaves the way it does and when you'd reach for one gate over another.

---

Basic Logic Operations

These three gates represent the fundamental Boolean operations. Every other gate can be built from some combination of AND, OR, and NOT.

AND Gate

The AND gate outputs 1 only when all inputs are 1. Think of it as a "both must be true" check, which makes it perfect for condition-checking circuits.

• Boolean expression: $A \cdot B$ or simply $AB$. The multiplication analogy works well here: any zero input "zeros out" the result.
• Common uses: enable signals and masking operations where multiple conditions must be satisfied at the same time.

OR Gate

The OR gate outputs 1 when any input is 1. It's the "at least one true" gate, ideal for combining multiple trigger conditions into a single output.

• Boolean expression: $A + B$. Think of addition where any nonzero term gives a nonzero result, though 1+1 still equals 1 in Boolean algebra, not 2.
• Common uses: interrupt handling and any scenario where multiple events should trigger the same response.

NOT Gate (Inverter)

The NOT gate outputs the complement of its single input. It's the only basic gate with just one input.

• Boolean expression: $\overline{A}$ or $A'$. It simply flips the signal.
• Essential for generating complementary signals and applying De Morgan's theorem during circuit simplification.

---

Universal Gates

A universal gate is one that can, by itself, implement any Boolean function. That means you can build AND, OR, NOT, and every other gate using only NAND gates, or using only NOR gates. This matters for IC design because manufacturing a chip with a single gate type simplifies fabrication.

NAND Gate

The NAND gate outputs 0 only when all inputs are 1. It's literally an AND followed by a NOT, hence "NOT-AND."

• Boolean expression: $\overline{A \cdot B}$. The output is the inverse of AND for every input combination.
• Universal gate: you can construct any logic function from NAND gates alone. Building these constructions is a common exam question.

To make a NOT gate from a NAND: tie both inputs together. When $A = 0$, $\overline{0 \cdot 0} = 1$. When $A = 1$, $\overline{1 \cdot 1} = 0$. That's inversion.

NOR Gate

The NOR gate outputs 1 only when all inputs are 0. It's an OR followed by a NOT, hence "NOT-OR."

• Boolean expression: $\overline{A + B}$. It produces the complement of OR for every input combination.
• Also a universal gate. Historically, NOR gates were used exclusively in the Apollo Guidance Computer.

To make a NOT gate from a NOR: same trick, tie both inputs together. When $A = 0$, $\overline{0 + 0} = 1$. When $A = 1$, $\overline{1 + 1} = 0$.

---

Exclusive Gates

These gates care about whether inputs match or differ, which makes them essential for comparison operations, arithmetic circuits, and error detection.

XOR Gate (Exclusive OR)

The XOR gate outputs 1 when the inputs are different. Unlike OR, it outputs 0 when both inputs are 1.

• Boolean expression: $A \oplus B$, which expands to $A\overline{B} + \overline{A}B$. That expanded form spells out exactly what's happening: "A is 1 and B is 0, or A is 0 and B is 1."
• Critical applications: binary addition (XOR produces the sum bit), parity generators, and comparator circuits.

XNOR Gate (Exclusive NOR)

The XNOR gate outputs 1 when the inputs are the same. It functions as an equality detector.

• Boolean expression: $\overline{A \oplus B}$, which expands to $AB + \overline{A}\overline{B}$. It outputs 1 for matching inputs (both 0 or both 1).
• Used in error detection, digital comparators, and anywhere you need to verify two signals match.

---

Quick Reference Table

---

Self-Check Questions

1. Which two gates are considered universal, and what does "universal" mean in this context?

2. Compare the truth tables of AND and NAND. How many output values differ between them, and why?

3. If you need a gate that outputs 1 only when two input signals are different, which gate would you choose? What if you needed the opposite behavior?

4. Using Boolean expressions, explain why $\overline{A + B}$ and $\overline{A} \cdot \overline{B}$ produce the same truth table. Which theorem does this demonstrate?

5. You're designing a circuit that should activate an alarm when either sensor A or sensor B detects motion, but not when both detect motion simultaneously. Which single gate implements this logic? Write out the truth table to verify your answer.