Reference

Glossary

Short, precise definitions of the terms used across the courses. Each entry links to the lesson that covers it in depth.

A

Application-specific integrated circuitASIC
A chip designed and fabricated for one function. An ASIC has no programmable fabric, so it is smaller, faster and lower power per function than an FPGA, but each design change requires a new fabrication run with high fixed costs.
Asynchronous FIFO
A FIFO whose write and read sides run on unrelated clocks. Its read and write pointers cross between domains as Gray codes through synchronisers, which makes it the standard way to move data streams between clock domains.

B

Bitstream
The binary configuration file that programs an FPGA. It sets every LUT, routing switch, memory initial value and I/O setting. Vendor tools generate it at the end of implementation.
Block RAMBRAM
Dedicated on-chip memory blocks in an FPGA, typically a few kilobits to tens of kilobits each, with one or two synchronous ports. Synthesis tools infer block RAM from arrays that are read and written with registered, clocked access.
Blocking and non-blocking assignment
In Verilog, a blocking assignment (=) updates its target immediately, while a non-blocking assignment (<=) schedules the update for the end of the time step. Use non-blocking assignments for registers in clocked blocks and blocking assignments in combinational blocks.

C

Carry chain
Dedicated fast routing and logic between adjacent logic cells that propagates the carry of an adder or counter. Synthesis tools map arithmetic such as a + b onto carry chains automatically.
Clock domain
The set of registers driven by one clock or by clocks with a known, fixed phase relationship. Signals passing between unrelated clock domains need synchronisation.
Clock domain crossingCDC
Any signal path from a register in one clock domain to a register in another, unrelated domain. CDC paths need synchronisers, handshakes or asynchronous FIFOs to avoid metastability and data corruption.
Combinational logic
Logic whose outputs depend only on its current inputs, with no memory. Multiplexers, decoders, comparators and adders are combinational. In HDL it is written with continuous assignments or always_comb blocks.
Complex programmable logic deviceCPLD
A programmable logic device built from a small number of sum-of-products macrocells connected by a central interconnect. CPLDs are usually non-volatile and have predictable pin-to-pin delays, but far less logic than an FPGA.
Configurable logic blockCLB
A cluster of LUTs, flip-flops, carry logic and local multiplexers that forms the repeating logic tile of an FPGA. Vendors use different names: CLB and slice (AMD), ALM and LAB (Altera), PFU (Lattice).
Critical path
The timing path with the least slack. It limits the maximum clock frequency of the design.

D

Device under testDUT
The module being verified by a testbench. Also called the unit under test (UUT).
Distributed RAM
Small memories built from the configuration memory of LUTs in logic blocks. Distributed RAM supports asynchronous reads and suits small buffers and register files.
DSP slice
A hard arithmetic block containing a multiplier, pre-adder, accumulator and pipeline registers. DSP slices run multiply-accumulate operations faster and with less power than the same function built from LUTs.

F

Field-programmable gate arrayFPGA
An integrated circuit made of configurable logic blocks, memory, arithmetic blocks and programmable routing. Loading a configuration file (bitstream) connects these resources to implement a custom digital circuit, and the device can be reconfigured with a different design later.
FIFO
A first-in, first-out buffer with write and read ports and full and empty flags. A synchronous FIFO uses one clock; an asynchronous FIFO uses separate write and read clocks.
Finite state machineFSM
A sequential circuit that moves between a finite set of states based on its inputs. In a Moore machine, outputs depend only on the current state; in a Mealy machine, they also depend on the inputs.
Fixed-point arithmetic
A number format that stores fractional values as integers with an implied binary point. Q1.15, for example, uses one sign bit and 15 fractional bits. Fixed-point maps directly onto FPGA adders and DSP multipliers.
Flip-flopFF
An edge-triggered storage element that captures its D input on a clock edge and holds it until the next edge. In FPGA logic blocks, each LUT output can feed a dedicated D flip-flop with optional clock enable, set and reset.

G

Gray code
A binary encoding in which consecutive values differ in exactly one bit. Gray-coded counters can cross clock domains safely because a sample taken during a change is either the old or the new value.

H

Hardware description languageHDL
A language for describing digital circuits, such as Verilog, SystemVerilog or VHDL. HDL code describes concurrent hardware and can be simulated or synthesized into gates.
High-level synthesisHLS
Tools that generate RTL from an algorithm written in C, C++ or a similar language. Designers guide the result with directives for pipelining, loop unrolling and interfaces.
Hold time
The minimum time a flip-flop's data input must remain stable after the active clock edge. Hold violations do not depend on clock frequency and must be fixed by adding delay to the short path.

I

I/O standard
The electrical specification of an FPGA pin, such as LVCMOS33 or LVDS, covering voltage levels, drive strength and termination. Each I/O bank supports the standards compatible with its supply voltage.
Integrated logic analyserILA
Debug logic inserted into an FPGA design that captures internal signals into on-chip memory when a trigger condition occurs, then reads them out over JTAG. AMD calls it ILA; Altera's equivalent is Signal Tap.

J

JTAG
A standard serial test and debug interface (IEEE 1149.1). FPGAs use it to load bitstreams, program configuration flash and connect on-chip logic analysers.

L

Latch
A level-sensitive storage element that is transparent while its enable is active. In FPGA designs, latches are usually created by mistake when a combinational block does not assign an output on every path, and they complicate timing analysis.
Look-up tableLUT
The basic combinational element of most FPGAs. A k-input LUT is a small memory of 2^k configuration bits addressed by its inputs, so it can implement any Boolean function of k variables. Modern devices use 4- to 6-input LUTs.

M

Maximum clock frequencyFmax
The highest clock frequency at which a design's critical path meets setup timing, equal to the reciprocal of the minimum achievable clock period.
Metastability
A state in which a flip-flop output sits between logic 0 and 1 for an unpredictable time after its setup or hold window was violated. The probability that it persists falls exponentially with the time allowed to resolve.

O

One-hot encoding
A state encoding that uses one flip-flop per state, with exactly one bit set at a time. It uses more flip-flops than binary encoding but often gives simpler, faster next-state logic in FPGAs.

P

Phase-locked loopPLL
A clock management circuit that generates output clocks at a multiple or fraction of an input clock, with controlled phase. FPGAs include PLLs or similar blocks (AMD calls one variant an MMCM) for clock synthesis and deskew.
Pipelining
Inserting registers into a long combinational path to split it into shorter stages. Pipelining raises the achievable clock frequency and throughput at the cost of added latency.
Place and routeP&R
The implementation step that assigns each netlist primitive to a physical location on the FPGA (placement) and connects them through the programmable routing (routing), guided by timing constraints.

R

Register
A group of flip-flops that share a clock and store a multi-bit value. In HDL, a register is inferred from a signal assigned inside a clocked process, such as an always_ff block.
Register-transfer levelRTL
A level of design abstraction that describes a circuit as registers and the combinational logic that moves and transforms data between them on each clock cycle. Most FPGA design is written at RTL.

S

Setup time
The minimum time a flip-flop's data input must be stable before the active clock edge for the value to be captured reliably. Setup violations are fixed by shortening the path or lowering the clock frequency.
Slack
The margin by which a timing path meets its requirement: required time minus arrival time. Positive slack means the path passes; negative slack means it fails. Reports summarise this as WNS (worst negative slack) and TNS (total negative slack).
Static timing analysisSTA
A method that checks every timing path in a design against its constraints without simulation. STA reports setup and hold slack for each path and flags paths that violate their requirements.
Synchronizer
A chain of two or more flip-flops in the destination clock domain that gives a metastable value time to resolve before the rest of the logic uses it. It is only safe for single-bit signals or Gray-coded values.
Synopsys Design ConstraintsSDC
A Tcl-based format for timing constraints such as create_clock, set_input_delay and set_false_path. Quartus uses SDC directly, and AMD's XDC format is based on it.
Synthesis
The step that converts RTL code into a netlist of device primitives such as LUTs, flip-flops, block RAM and DSP slices. Synthesis also optimises logic and reports inferred resources and warnings.
SystemVerilogSV
The successor to Verilog, standardised as IEEE 1800. It adds design features such as logic, always_ff, always_comb, enums and interfaces, and a large set of verification features including classes, constrained randomisation and assertions.
SystemVerilog assertionsSVA
A part of SystemVerilog for stating properties a design must satisfy, either as immediate checks or as temporal properties over clock cycles. Assertions are checked in simulation and by formal verification tools.

T

Testbench
HDL code that drives a design under test with stimulus in simulation and checks its outputs. A self-checking testbench compares results against expected values and reports pass or fail without manual waveform inspection.
Timing closure
The process of modifying a design, its constraints or the tool settings until all timing paths meet their setup and hold requirements.

U

UART
Universal asynchronous receiver-transmitter: a serial interface that sends bytes framed by a start bit and stop bits, with no shared clock. Both ends agree on a baud rate, such as 115200 bits per second.

V

Verilog
A hardware description language with a C-like syntax, standardised as IEEE 1364 and later merged into SystemVerilog (IEEE 1800).
VHDL
A strongly typed hardware description language standardised as IEEE 1076. It is common in European industry, aerospace and defence. The name stands for VHSIC Hardware Description Language.

X

Xilinx Design ConstraintsXDC
The constraint file format used by AMD Vivado. It combines SDC-style timing constraints with physical constraints such as pin locations and I/O standards.