Digital Logic Gates

Why This Matters

Digital logic gates are the fundamental decision-makers of every electronic system you'll encounter in this course. When you're analyzing circuits, designing control systems, or understanding how a computer processes information, you're working with combinations of these basic building blocks. The gates themselves implement Boolean algebra physically, turning abstract logical operations into real voltage levels that drive everything from smartphones to spacecraft.

You're being tested on more than just memorizing truth tables. Exam questions will ask you to recognize functional equivalence between gate combinations, identify universal gates that can build any circuit, and apply gates to practical problems like error detection, arithmetic operations, and signal conditioning. Don't just memorize what each gate outputs. Know why you'd choose one gate over another and how gates combine to create complex logic functions.

---

Basic Logic Operations

These three gates form the foundation of Boolean algebra. Every other gate can be built from some combination of AND, OR, and NOT, so mastering them is the key to analyzing any digital circuit.

AND Gate

• Outputs HIGH (1) only when ALL inputs are HIGH. Think of it as a series circuit where every switch must be closed for current to flow.
• Boolean expression: $A \cdot B$ or simply $AB$. The multiplication analogy helps here: any zero input "zeroes out" the result.
• Used when multiple conditions must ALL be satisfied. Common applications include safety interlocks, enable signals, and permission logic in control systems.

Truth table for a 2-input AND:

OR Gate

• Outputs HIGH (1) when ANY input is HIGH. Like a parallel circuit where any closed switch completes the path.
• Boolean expression: $A + B$. The addition analogy works, but remember this is not arithmetic addition: $1 + 1 = 1$ in Boolean logic, not 2.
• Essential for alert systems and redundancy. Fire alarms, fault detection, or any application where multiple triggers should produce the same response.

Truth table for a 2-input OR:

NOT Gate (Inverter)

• Outputs the logical complement of its input. HIGH becomes LOW, LOW becomes HIGH.
• Boolean expression: $\bar{A}$ (also written $A'$ or $\neg A$). This is the simplest gate, with only one input and one output.
• Creates active-low signals and enables complementary logic. Critical for level shifting, signal conditioning, and building more complex gates from simpler ones.

---

Universal Gates

These gates earn the "universal" designation because you can construct ANY logic function using only one type. This isn't just a theoretical curiosity. Manufacturing efficiency and circuit standardization make universal gates incredibly practical, since a factory only needs to produce one type of gate to build any circuit.

NAND Gate

• Outputs LOW (0) only when ALL inputs are HIGH. Functionally, it's an AND gate followed by a NOT gate.
• Boolean expression: $\overline{A \cdot B}$. The "NOT-AND" name tells you exactly what it does.
• Universal gate status means any circuit can be built from NANDs alone. This simplifies manufacturing and is why NAND-based designs dominate integrated circuits.

Notice the output column is the exact inverse of the AND truth table.

NOR Gate

• Outputs HIGH (1) only when ALL inputs are LOW. Functionally, it's an OR gate followed by a NOT gate.
• Boolean expression: $\overline{A + B}$. It outputs the opposite of what an OR gate would.
• Also a universal gate with historical significance. The Apollo Guidance Computer was built entirely from approximately 5,600 NOR gates.

Building Other Gates from NAND (A Common Exam Topic)

To prove NAND is universal, you need to show it can replicate NOT, AND, and OR. Here's how:

1. NOT from NAND: Connect both inputs of a NAND gate to the same signal $A$. The output is $\overline{A \cdot A} = \bar{A}$.
2. AND from NAND: Take the output of a NAND gate and feed it into a second NAND wired as a NOT (step 1). You get $\overline{\overline{A \cdot B}} = A \cdot B$.
3. OR from NAND: First invert each input using NAND-as-NOT gates, then feed those inverted signals into a third NAND gate. By De Morgan's theorem, $\overline{\bar{A} \cdot \bar{B}} = A + B$.

Since NOT, AND, and OR can produce any Boolean function, and NAND can produce all three, NAND alone can build anything.

---

Exclusive Operations

These gates handle parity and equality. You use them when you care about whether inputs match or differ, not just whether they're high or low. They're essential for arithmetic circuits and data integrity checking.

XOR Gate (Exclusive OR)

• Outputs HIGH (1) when inputs are DIFFERENT. For more than two inputs, it outputs HIGH when an odd number of inputs are HIGH.
• Boolean expression: $A \oplus B$, which is equivalent to $(A \cdot \bar{B}) + (\bar{A} \cdot B)$.
• Critical for binary addition and parity checking. The sum bit in a half-adder is just an XOR gate. Error detection codes (like parity bits) rely heavily on XOR operations.

XNOR Gate (Exclusive NOR)

• Outputs HIGH (1) when inputs are THE SAME. It's the complement of XOR.
• Boolean expression: $\overline{A \oplus B}$, also written as $A \odot B$.
• Functions as an equality comparator. It outputs 1 when $A = B$, making it the go-to gate for digital comparators and error correction circuits. If an exam asks you to design a single-bit comparator, XNOR is your answer.

---

Quick Reference Table

---

Self-Check Questions

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

2. You need a gate that outputs HIGH only when exactly one of two inputs is HIGH. Which gate do you use, and what is its Boolean expression?

3. Compare and contrast the AND and NAND gates: How do their truth tables relate to each other, and why might a designer choose NAND over AND in manufacturing?

4. If you're designing a circuit to check whether two binary signals are equal, which gate serves as a single-bit comparator? Write the Boolean condition it implements.

5. Implement an OR gate using only NAND gates. Describe the configuration step by step, and explain why this demonstrates NAND's universal property.