silicon atlasTHE HARDWARE REFERENCE
العربية
Reference/Specialized silicon
NPU & accelerators

FPGAs, ASICs & programmable logic

Change the circuit, specialize it permanently, or execute instructions on an existing circuit.

Programming an FPGA describes a circuit, not merely a sequence for a CPU to run.
LUT

Configurable logic function.

LIVE EXPERIMENT

Build a decision

Runs on your device
Tap each input to flip it.
A
B
XORA ≠ B
1OUTPUT
Truth table
ABXOR
000
011
101
110

NAND can build any Boolean function. Combining small gates creates selectors, adders, and control.

What this model includes

Ideal Boolean logic. Electrical timing and noise are omitted.

FOLLOW THE MECHANISM

What happens inside

1

Configure the fabric

An FPGA combines configurable lookup tables, flip-flops, routing, block RAM, and often DSP and high-speed I/O blocks. Configuration bits select functions and connections. HDL describes concurrent hardware behavior; synthesis and place-and-route transform it into a mapped design. Timing closure is part of making it work.

2

Trade flexibility for efficiency

An ASIC implements a chosen circuit in manufactured silicon, avoiding much of the programmable routing overhead but requiring substantial design and fabrication effort. FPGA logic can build custom pipelines and protocols, but resource, frequency, and power constraints remain. A CPU or GPU instead executes programs within a largely fixed architecture.

PUT IT TO WORK

What this means for your code

Low-level engineer

Learn HDL semantics, clock-domain crossings, timing constraints, and verification. A simulation passing does not prove timing closure on hardware.

Software developer

FPGAs fit custom streaming and low-latency protocols when development cost is justified. They are not a drop-in faster CPU for arbitrary software.

GO TO THE SOURCE

Read the actual specifications

These references supply the underlying contracts and implementation details. The diagrams here are simplified teaching models.

AMD · FPGA lookup tablesAMD
Nand2Tetris · Boolean logicHebrew University / Reichman University

Keep following the connection

Understood the idea? Keep a note of your progress.