Inferensys

Glossary

LUT Memory Depth

The number of sequential historical signal samples used in conjunction with the instantaneous index to address a multi-dimensional predistortion look-up table, enabling correction of power amplifier memory effects.
Developer demonstrating multi-agent tool use, agent tool selection interface on laptop, casual tech demo moment.
MULTI-DIMENSIONAL INDEXING

What is LUT Memory Depth?

LUT memory depth defines the number of sequential historical signal samples used alongside the instantaneous envelope index to address a multi-dimensional predistortion look-up table, capturing the power amplifier's memory effects.

LUT memory depth is the parameter specifying how many past input samples are concatenated with the current sample to form a multi-dimensional address for the predistortion look-up table. While a memoryless LUT uses only the instantaneous signal envelope to index a single correction coefficient, introducing memory depth creates a tapped-delay-line structure where the current index and N previous indices jointly select a predistortion value. This transforms the LUT from a one-dimensional curve into an N+1-dimensional hyperplane capable of compensating for dynamic nonlinearities that depend on signal history.

Increasing memory depth improves linearization accuracy for wideband signals where power amplifier memory effects—caused by bias circuit impedance, thermal dynamics, and trapping phenomena—are significant. However, memory depth drives exponential growth in LUT size: a table with depth D and K quantization levels per dimension requires K^(D+1) entries. Practical implementations typically limit depth to 1–3 taps and employ LUT partitioning or interpolation to manage the memory footprint while capturing the dominant memory polynomial terms essential for spectral regrowth mitigation.

MULTI-DIMENSIONAL INDEXING

Key Characteristics of LUT Memory Depth

Memory depth defines the number of sequential historical samples used alongside the instantaneous envelope to address a predistortion look-up table, capturing the power amplifier's dynamic nonlinear behavior.

01

Temporal Memory Modeling

Memory depth captures the power amplifier's short-term memory effects caused by bias circuit impedance, trapping phenomena, and thermal dynamics. A depth of D taps means the LUT is indexed not just by the current sample |x(n)|, but also by |x(n-1)|, |x(n-2)|, ..., |x(n-D)|. This creates a (D+1)-dimensional addressing space that maps historical envelope values to predistortion coefficients, enabling the correction of frequency-dependent nonlinearities that simple memoryless models miss.

2-5
Typical Memory Taps
3D+
Addressing Dimensions
02

Exponential Memory Growth

Adding memory depth causes exponential growth in LUT storage requirements. If a memoryless LUT with K entries per dimension requires K coefficients, a depth-D LUT requires K^(D+1) entries. For example, a 256-entry table with depth 2 demands 256³ = 16.7 million coefficients. This explosion drives the need for LUT partitioning, compression techniques, and sparse indexing to make multi-dimensional predistortion feasible in FPGA or ASIC implementations with constrained block RAM.

K^(D+1)
Storage Complexity
16.7M
Entries at K=256, D=2
03

Addressing Logic Complexity

Multi-dimensional LUT addressing requires hardware-efficient index computation. The memory address is formed by concatenating or hashing the quantized values of the current and delayed envelope samples:

  • Linear addressing: address = i₀ + K·i₁ + K²·i₂ + ... + K^D·i_D
  • Tile-based addressing: partitions the multi-dimensional space into smaller sub-tables
  • Hashing: reduces dimensionality through XOR or polynomial mixing of tap indices The addressing logic must complete within a single clock cycle to maintain real-time throughput at giga-sample rates.
< 1 cycle
Address Computation Latency
04

Memory Tap Selection

Not all historical samples contribute equally to distortion correction. Tap selection algorithms identify the most significant delay positions:

  • Uniform spacing: taps at n-1, n-2, n-3, ...
  • Non-uniform spacing: taps clustered around the main impulse response lobe
  • Sparse selection: uses only 2-3 taps at critical delays identified through correlation analysis or LASSO regression Optimal tap selection reduces the effective dimensionality while preserving adjacent channel leakage ratio (ACLR) improvement.
2-3
Sparse Tap Count
0.5 dB
ACLR Loss vs Full Depth
05

Depth vs. Bandwidth Relationship

The required memory depth scales with signal bandwidth relative to the PA's memory time constant. Narrowband signals (< 20 MHz) often need only 1-2 taps because the envelope varies slowly relative to memory effects. Wideband signals (> 100 MHz) for 5G NR and satellite communications demand 3-5 taps to capture frequency-dependent gain and phase variations across the band. The memory span (D × sampling period) must exceed the PA's impulse response duration for complete linearization.

1-2
Taps for < 20 MHz
3-5
Taps for > 100 MHz
06

Adaptation Convergence with Depth

Increasing memory depth slows LMS and RLS adaptation convergence because the coefficient vector grows exponentially. A depth-D system must estimate K^(D+1) complex coefficients from the error signal. Techniques to accelerate convergence include:

  • Per-tap learning rate scaling: higher rates for recent taps, lower for older taps
  • Decoupled adaptation: train each memory dimension independently using separable least squares
  • Initialization from memoryless solution: start with converged depth-0 coefficients and incrementally add taps Convergence time typically scales as O(K^D) iterations.
O(K^D)
Convergence Scaling
LUT MEMORY DEPTH

Frequently Asked Questions

Clarifying the role of sequential historical samples in multi-dimensional look-up table addressing for power amplifier linearization.

LUT memory depth is the number of sequential historical signal samples used alongside the instantaneous envelope index to address a multi-dimensional predistortion look-up table. It is critical because power amplifiers exhibit electro-thermal memory effects—the current output depends not only on the present input but also on past signal states due to trapping, heating, and bias network dynamics. Without sufficient memory depth, a static LUT cannot compensate for these dispersive nonlinearities, leaving significant residual distortion. The depth parameter M defines how many past samples x(n-1), x(n-2), ..., x(n-M) are concatenated with the current sample x(n) to form the full addressing vector, effectively expanding the LUT from a 1D to an (M+1)-dimensional mapping that captures the amplifier's dynamic behavior.

MULTI-DIMENSIONAL CORRECTION

Practical Applications of LUT Memory Depth

LUT memory depth extends predistortion from a static, memoryless function to a dynamic correction engine capable of counteracting the power amplifier's history-dependent nonlinearities. These applications demonstrate how sequential sample memory enables wideband linearization.

01

Wideband Signal Linearization

For modulation bandwidths exceeding 100 MHz in 5G NR and satellite communications, the power amplifier exhibits significant electrical memory effects. A memoryless LUT fails to correct frequency-dependent distortion. By incorporating 2-3 memory taps, the LUT addresses a multi-dimensional space where each index combines the instantaneous envelope with prior sample magnitudes, suppressing spectral regrowth that a static table cannot reach.

>100 MHz
Signal Bandwidth
2-3
Memory Taps Required
02

Thermal Memory Effect Compensation

GaN and GaAs power amplifiers suffer from slow thermal trapping effects where die temperature modulates gain on a microsecond scale. A memory depth of 1-2 captures these long-term memory effects by correlating current distortion with the envelope history. The LUT effectively learns a thermal inverse model, stabilizing gain over bursty transmission patterns common in TDD systems.

µs
Thermal Time Constant
03

Doherty Amplifier Phase Correction

Doherty power amplifiers exhibit complex load modulation dynamics where the peaking amplifier's turn-on characteristic introduces a history-dependent phase shift. A memory depth of 2-3 allows the LUT to index not just the current signal level but the trajectory of the envelope through the Doherty transition region. This corrects the AM-PM distortion that memoryless tables leave uncorrected, restoring modulation accuracy.

2-3
Memory Depth for Doherty
04

Envelope Tracking Supply Rejection

In envelope tracking systems, the power amplifier supply voltage dynamically follows the signal envelope. Mismatches between the RF envelope and the tracker's slew rate create a memory-dependent distortion mechanism. A multi-tap LUT learns the interaction between the supply voltage trajectory and the resulting gain variation, jointly correcting the PA nonlinearity and the tracker-induced artifacts.

05

Multi-Band Concurrent Distortion Cancellation

When amplifying two widely separated carriers simultaneously, cross-modulation products depend on the combined envelope history of both signals. A memory depth of 3-5 constructs a high-dimensional indexing space that captures the intermodulation memory, allowing a single LUT to cancel distortion products that fall into both transmit bands and the adjacent spectrum.

3-5
Memory Depth for Multi-Band
06

Hardware Complexity vs. Correction Trade-Off

Each additional memory tap exponentially increases the LUT address space. A depth of 3 with 256 envelope quantization levels yields 16.7 million potential entries. Practical implementations use LUT partitioning and interpolation to manage this curse of dimensionality. The optimal depth is the minimum required to meet the ACLR specification, balancing FPGA block RAM consumption against linearization performance.

16.7M
Entries at Depth 3
Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.