Computing & Digital Architecture
From mechanical switches and Boolean algebra to modern microprocessors: how silicon transistors, logic gates, instruction pipelines, and memory hierarchies turn electric voltages into universal computation.
Pieces in this series
How Binary and Logic Gates Became Computation
How George Boole mapped human thought to two numbers, Claude Shannon proved switches could do algebra, and silicon transistors turned electric currents into logic
Computers do not contain tiny mathematicians; they contain billions of microscopic transistors switching electrical potentials. In 1854, George Boole reduced logical propositions to binary values (1 and 0) and three operators: AND, OR…
How a CPU Executes an Instruction
How a CPU executes machine code through the Fetch, Decode, Execute, Memory, and Writeback pipeline using registers, decoders, clock signals, and the ALU
All software compiles into raw binary opcodes stored in system memory. A central processing unit is a clocked assembly line of physical logic gates and register circuits that processes billions of instructions per second. Tracing the…
How Computer Memory (RAM) Actually Works
Capacitor charge leakage, 1T1C bit cells, differential sense amplifiers, and the nanosecond choreography of DRAM refresh
While a CPU executes billions of operations per second, its internal registers hold only a few hundred bytes. The active working state of applications lives in Dynamic RAM (DRAM). Storing each bit as a few thousand electrons inside a…
How an Operating System Actually Runs Software
Hardware privilege rings, preemptive timer interrupts, MMU virtual memory page tables, and context switching
A CPU blindly fetches and executes binary instructions without any concept of applications, files, or security. The operating system creates this multi-tenant illusion by collaborating with hardware: enforcing CPU privilege rings, using…
How CMOS Transistors Form Logic Gates
Complementary NMOS and PMOS pairs, silicon pull-up and pull-down networks, voltage transfer margins, and the physical mechanics of Boolean switches
Early digital computers built with NMOS circuits dissipated massive waste heat because current flowed continuously to ground whenever switches turned on. Complementary Metal-Oxide-Semiconductor (CMOS) technology solved this by pairing…
How Binary Arithmetic Logic Units Actually Add Numbers
From half adders and ripple-carry latency to carry-lookahead prefix trees, two's complement subtraction, and status flag generation in physical silicon
Chaining 1-bit Full Adders into a Ripple-Carry Adder creates a severe bottleneck: the carry bit must crawl through 64 gate pairs before producing a sum. Modern Arithmetic Logic Units solve this with Carry-Lookahead Adders and parallel…
How the CPU Clock Synchronizes Billions of Transistors
Quartz piezoelectric vibration, phase-locked loop multiplication, H-tree distribution grids, clock skew, and setup-and-hold timing margins
Without synchronization, faster electronic signals on a chip would race ahead of slower ones, corrupting data. A modern CPU prevents digital entropy using a synchronous clock operating above four gigahertz. Originating in a vibrating…
How CPU Cache Hierarchies Overcome the Memory Wall
6T SRAM bistable latches, spatial and temporal locality, set-associative tag matching, and MESI multicore cache coherency
While processor speeds grew exponentially, DRAM access latency improved sluggishly, creating the architectural Memory Wall. To prevent pipelines from stalling for hundreds of cycles, CPUs employ a pyramid of high-speed SRAM caches. Guided…
How Solid-State Drives (SSDs) and Flash Memory Store Data Without Power
Floating-gate and charge-trap MOSFETs, Fowler–Nordheim quantum tunneling, TLC/QLC voltage windows, and the Flash Translation Layer
Solid-State Drives store data without power by trapping electrons inside floating gates or silicon nitride charge-trap layers insulated by silicon dioxide. Using ~20 V pulses to trigger Fowler-Nordheim quantum tunneling, flash chips write…
How Compilers Translate Human Code into Machine Instructions
From text tokens and abstract syntax trees to SSA intermediate representation, register allocation, and native machine code
Computers cannot execute high-level syntax; they only process binary opcodes in hardware registers. A compiler bridges this conceptual gap through an optimizing pipeline: lexing source text into tokens, parsing Abstract Syntax Trees…
In the scriptorium — this series continues to unfold