Transistors as Logic Gates

2025-03-15

Mar 15, 2025

Relationship Between RTL Circuits and Digital Logic

The RTL (Resistor-Transistor Logic) circuits we've examined for NOT, NAND, and NOR gates in this article and this article, represent the physical implementation of digital logic functions. These circuits bridge the gap between abstract Boolean algebra and real-world electronic behavior.

Fundamental Building Blocks

The NOT (inverter), NAND, and NOR circuits we explored are the fundamental building blocks of digital systems for several reasons:

Logic Completeness: NAND and NOR gates are "functionally complete," meaning any other logic function (AND, OR, XOR, etc.) can be built using only NAND gates or only NOR gates. This property stems directly from De Morgan's laws.
Physical Embodiment of Boolean Algebra: The circuits directly implement the operations described in Boolean algebra:
- NOT circuit: Implements logical negation (¬A)
- NAND circuit: Implements NOT-AND (¬(A∧B))
- NOR circuit: Implements NOT-OR (¬(A∨B))

Transistors as Switches

In the diagrams we examined:

NOT Gate (Inverter):
- A single transistor acts as a voltage-controlled switch
- When OFF (input LOW), output is pulled HIGH through resistor
- When ON (input HIGH), output is pulled LOW through transistor to ground

NAND Gate:

Two transistors in series require both to be ON to create a path to ground
This implements the logical function: Output is LOW only when both inputs are HIGH

NOR Gate:

Two transistors in parallel where either can create a path to ground
This implements the logical function: Output is LOW when any input is HIGH

Abstraction Layers in Digital Design

RTL circuits represent one of several abstraction layers in digital design:

Physics Layer: Semiconductor behavior (p-n junctions, electron flow)
Device Layer: Transistors functioning as switches
Circuit Layer: RTL implementations of logic gates
Logic Layer: Boolean operations (AND, OR, NOT)
Function Layer: Combinational circuits (adders, multiplexers)
System Layer: Sequential circuits and state machines
Architecture Layer: Processors, memory systems, etc.

Our diagrams showed the circuit layer, demonstrating how transistors (device layer) implement logic functions.

Historical and Practical Significance

RTL was one of the earliest forms of integrated circuit logic from the 1960s. While modern digital circuits use more advanced technologies like CMOS, the fundamental principles remain the same:

Binary States: Transistors enable the creation of reliable binary states (1/0, HIGH/LOW, TRUE/FALSE)
Logic Implementation: Arranging transistors in specific configurations (series, parallel) creates different logic functions
Logical Completeness: The ability to implement any logical function with a limited set of gate types

Understanding these RTL implementations helps visualize how abstract logical operations are realized through physical electronic components, forming the foundation of all digital systems from simple calculators to advanced microprocessors.

De Morgan's Laws in Digital Logic

De Morgan's laws are fundamental principles in Boolean algebra that describe the relationship between complementation (NOT) and the logical operators AND and OR. These laws are especially important in digital circuit design, as they allow designers to convert between different gate types.

The Two Laws

De Morgan's laws can be stated as:

NOT (A AND B) = (NOT A) OR (NOT B)
NOT (A OR B) = (NOT A) AND (NOT B)

In Boolean notation:

¬(A ∧ B) = ¬A ∨ ¬B
¬(A ∨ B) = ¬A ∧ ¬B

Application to Logic Gates

These laws have direct applications to NAND and NOR gates:

NAND Gates

A NAND gate is defined as NOT (A AND B). By De Morgan's first law, this is equivalent to (NOT A) OR (NOT B).

This means:

A NAND gate can be represented as an AND gate followed by a NOT gate
A NAND gate is also equivalent to inverting both inputs and then using an OR gate

NOR Gates

A NOR gate is defined as NOT (A OR B). By De Morgan's second law, this is equivalent to (NOT A) AND (NOT B).

This means:

A NOR gate can be represented as an OR gate followed by a NOT gate
A NOR gate is also equivalent to inverting both inputs and then using an AND gate

Gate Substitution

De Morgan's laws allow designers to substitute gates based on what's available:

If you need an AND gate but only have NAND gates:
- Use a NAND gate followed by a NOT gate (implemented as another NAND with both inputs tied together)

If you need an OR gate but only have NAND gates:

Invert both inputs using NOT gates (each implemented as a NAND with tied inputs)
Feed these into a NAND gate

Similarly, NOR gates can be used to implement any other gate function.

Universal Gates

Both NAND and NOR are called "universal gates" because either one can be used to implement any other logic function. This property comes directly from De Morgan's laws and is why NAND gates are so prevalent in integrated circuits - they can implement any required logic function while using a single gate type, simplifying manufacturing.

Practical Example

Consider a circuit that needs to implement the function: F = A · B + C (Where · represents AND, + represents OR)

If only NAND gates are available, De Morgan's laws help transform this into an equivalent NAND-only implementation.

This demonstration of De Morgan's laws shows why understanding these principles is essential for efficient digital circuit design and optimization.

Paul’s Substack

Discussion about this post