Logic Gates and Circuits: From AND Gates to Adders

Logic gates are the physical building blocks of digital circuits: tiny electronic switches, each implementing one basic Boolean operation such as AND, OR or NOT. A circuit wires gates together so that the whole network computes a larger Boolean function of its inputs.

Gates matter because everything digital — phones, laptops, traffic lights — is ultimately a vast circuit of gates. The journey from a single AND gate to a full adder shows how mindless on/off switches compose into machines that add, remember and decide.

Key Concepts

• AND / OR / NOT: the three fundamental gates, computing A AND B, A OR B and not A.
• NAND / NOR: AND/OR followed by NOT; each is universal — any circuit can be built from NAND gates alone.
• XOR / XNOR: output 1 when the inputs differ / agree.
• Combinational circuit: output depends only on current inputs, with no memory.
• Fan-in and propagation delay: how many inputs a gate accepts, and the small time a signal takes to pass through it.

Formulas

• AND: Y = A AND B — 1 only when A = 1 and B = 1.
• OR: Y = A OR B — 1 when at least one input is 1.
• NOT: Y = not A — inverts the input.
• XOR: Y = A xor B = (A AND not B) OR ((not A) AND B) — 1 exactly when inputs differ.
• Half adder: Sum = A xor B, Carry = A AND B — adds two bits.

Worked Example

Build a half adder and add 1 + 1. The XOR gate gets A = 1, B = 1: Sum = (1 AND not 1) OR ((not 1) AND 1) = (1 AND 0) OR (0 AND 1) = 0. The AND gate computes Carry = 1 AND 1 = 1. The result is Carry=1, Sum=0, i.e. binary 10, which is decimal 2. Adding 1 + 0: Sum = (1 AND 1) OR (0 AND 0) = 1, Carry = 1 AND 0 = 0, giving binary 01 = decimal 1. Chaining full adders extends this to multi-bit addition.

Common Misconceptions

• "You need many gate types to build a computer." NAND alone suffices — universality means one gate type can implement every Boolean function.
• "A circuit remembers past inputs." Only combinational circuits are discussed here; memory needs sequential circuits with feedback (flip-flops).
• "More gates always means slower." Depth (longest gate chain), not total gate count, sets the delay — parallel paths compute simultaneously.

Real-World Applications

• Arithmetic units: adders, multipliers and ALUs in every processor are gate networks.
• Multiplexers and decoders: route signals and select memory addresses in computers.
• Control logic: washing machines, elevators and traffic signals run on small gate-based controllers.

Logic gates implement Boolean operations in hardware, and circuits compose them into functions like addition — the half adder's Sum = A xor B and Carry = A AND B being the classic first example. From these humble switches, all of computing is built.