A Look-Up Table (LUT) DPD is a digital pre-distortion technique that stores pre-computed complex gain correction coefficients in a memory table, indexed by the instantaneous magnitude of the input signal. As each baseband sample arrives, its envelope amplitude serves as an address to retrieve a corresponding multiplicative correction factor that compensates for the power amplifier's AM-AM and AM-PM distortion.
Glossary
Look-Up Table (LUT) DPD

What is Look-Up Table (LUT) DPD?
A memory-based linearization method that uses pre-computed complex gain correction values indexed by the instantaneous input amplitude to compensate for static non-linearity.
LUT DPD is computationally efficient for correcting static non-linearity but struggles with memory effects unless extended to multi-dimensional tables. Coefficients are typically populated during an offline calibration phase using a least-squares fit between the amplifier's measured output and the desired linear response, making it a foundational yet limited approach compared to polynomial-based or neural network DPD architectures.
Key Characteristics of LUT DPD
Look-Up Table Digital Pre-Distortion is the foundational memory-based linearization method that applies pre-computed complex gain correction values indexed by instantaneous input amplitude to compensate for static power amplifier non-linearity.
Amplitude-Indexed Correction
The core mechanism of LUT DPD is a direct mapping from instantaneous input signal magnitude to a stored complex gain correction factor. The input signal's envelope |x(n)| is quantized into discrete bins, each addressing a unique memory location containing a pre-computed complex multiplication coefficient. This coefficient simultaneously corrects both AM-AM distortion (gain compression) and AM-PM distortion (phase rotation) introduced by the power amplifier. The predistorter multiplies the incoming baseband sample by the retrieved complex value, effectively applying the inverse of the amplifier's static non-linear transfer function before the signal reaches the PA.
Static Non-Linearity Compensation
LUT DPD is fundamentally designed to address memoryless non-linearity—distortion that depends solely on the current input sample, not on past values. This makes it highly effective for narrowband signals where the PA's bandwidth is much larger than the signal bandwidth, and thermal memory effects are negligible. The technique excels at correcting the classic soft compression curve of Class AB amplifiers and the severe gain inflection points of Doherty power amplifiers operating near saturation. However, as signal bandwidth increases in modern 5G and satellite communications, pure LUT approaches struggle because the PA's output becomes dependent on previous symbols, introducing memory effects that a static table cannot capture.
Quantization and Table Resolution
The performance of LUT DPD is critically dependent on table resolution—the number of discrete amplitude bins. A coarse table with few entries introduces quantization noise and stair-step discontinuities in the predistortion function, generating unwanted intermodulation products. Conversely, an excessively fine table increases memory footprint and adaptation time without proportional linearization gains. Typical implementations use 64 to 1024 entries with non-uniform spacing, where bins are denser in regions of rapid gain variation (near compression points) and sparser in linear regions. Advanced designs employ linear interpolation between adjacent bins to smooth the correction surface and reduce required table depth.
Adaptation and Coefficient Training
LUT coefficients are populated through an offline or online training process that characterizes the PA's non-linear transfer function. In the indirect learning architecture, a training sequence is transmitted, the PA output is captured and normalized, and the complex gain error at each amplitude bin is computed by comparing the ideal linear output to the actual distorted output. The inverse of this error becomes the stored correction value. Online adaptation continuously updates table entries using a feedback receiver to track changes due to temperature drift, device aging, and antenna load mismatch. The adaptation rate must balance tracking speed against stability—too fast an update can cause oscillation, while too slow fails to compensate for dynamic environmental changes.
Implementation Complexity and Latency
LUT DPD offers the lowest computational complexity of any DPD architecture, making it ideal for cost-sensitive and power-constrained applications. The predistortion operation reduces to a single complex multiply per sample after the address calculation. Address generation requires computing the signal magnitude √(I² + Q²), which can be approximated using the CORDIC algorithm or simplified magnitude estimators to avoid expensive square-root operations. Total latency is typically a few clock cycles, enabling use in real-time wideband systems. This efficiency comes at the cost of linearization performance—LUT DPD typically achieves 5-10 dB less ACLR improvement compared to memory polynomial or neural network approaches when applied to wideband signals with significant memory effects.
Multi-Dimensional LUT Extensions
To address the limitations of one-dimensional amplitude-only indexing, multi-dimensional LUT architectures extend the indexing scheme to include additional signal parameters. A 2D LUT indexes by both instantaneous amplitude and its derivative or by amplitude and a lagging envelope value, capturing first-order memory effects. 3D LUTs add further dimensions such as the amplitude of a delayed sample or the signal's instantaneous frequency. These extensions bridge the gap between pure static LUTs and full behavioral models like the Generalized Memory Polynomial, offering improved linearization for moderate-bandwidth signals while retaining much of the implementation simplicity. The trade-off is exponential growth in table size—a 2D table with 64 bins per dimension requires 4096 entries.
Frequently Asked Questions
Clear, technical answers to the most common questions about Look-Up Table Digital Pre-Distortion, its mechanisms, and its role in modern power amplifier linearization.
A Look-Up Table (LUT) DPD is a memory-based linearization method that applies a pre-computed, complex-valued gain correction to the input signal based on its instantaneous amplitude. The core mechanism involves a two-dimensional table stored in memory where the input signal's magnitude serves as the index. For each index, the table stores a complex gain coefficient that is the exact inverse of the power amplifier's AM-AM and AM-PM distortion at that specific power level. During operation, the system calculates the magnitude of the incoming baseband sample, uses it to address the LUT, retrieves the corresponding complex correction factor, and multiplies it with the original signal. This effectively pre-distorts the signal so that the cascaded response of the DPD and the power amplifier is linear. LUT DPD is particularly effective for correcting static non-linearity where the amplifier's behavior does not depend on the signal's history, making it a computationally lightweight solution for narrowband applications.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Related Terms
Core concepts that define the architecture, limitations, and operational context of memory-based Look-Up Table linearization.
AM-AM Distortion
The primary non-linearity that LUT DPD is designed to correct. AM-AM distortion describes the non-linear relationship between the input signal's instantaneous amplitude and the output signal's amplitude, manifesting as gain compression at high power levels.
- LUTs store complex gain values that are the exact inverse of the measured AM-AM curve.
- Correction is purely amplitude-dependent, ignoring phase dynamics.
- Effective only for memoryless or quasi-memoryless power amplifiers.
AM-PM Distortion
The phase-domain counterpart to AM-AM distortion. AM-PM distortion occurs when the phase shift introduced by the power amplifier varies as a function of the instantaneous input amplitude.
- A standard LUT addresses this by storing complex-valued correction coefficients (I and Q) rather than scalar gains.
- The LUT simultaneously corrects amplitude compression and phase rotation at each index point.
- Severe AM-PM conversion often indicates the presence of memory effects, which a static LUT cannot fully compensate.
Memory Effects
The fundamental limitation of static LUT-based DPD. Memory effects refer to the dependence of a power amplifier's current output on past input values, caused by:
- Thermal dynamics: Transistor junction temperature changes with signal history.
- Bias network impedance: Low-frequency envelope currents modulate the supply.
- Trapping effects: Charge capture and release in semiconductor materials.
A pure LUT has no mechanism to model these temporal dependencies, leading to residual distortion in wideband signals where memory effects dominate.
Coefficient Adaptation
The process of dynamically updating LUT entries to track time-varying amplifier behavior. Without adaptation, a static LUT becomes inaccurate due to:
- Temperature drift during operation.
- Aging of the transistor over its lifecycle.
- Load mismatch from antenna impedance changes.
Adaptation typically uses a least mean squares (LMS) or recursive least squares (RLS) algorithm to update individual LUT bins based on the error between the desired and observed output.
Generalized Memory Polynomial (GMP)
The successor model that addresses LUT limitations. The GMP extends the basic memory polynomial by including cross-terms between the signal and its lagging or leading envelope values.
- Captures complex memory effects that a static LUT cannot.
- Serves as the baseline behavioral model against which neural network DPD is benchmarked.
- Represents the transition from memoryless LUT correction to full Volterra series-based dynamic linearization.
Indirect Learning Architecture (ILA)
A common identification method used to populate LUT coefficients. In ILA, the predistorter parameters are estimated by:
- Swapping the input and output of the power amplifier model.
- Training a post-distorter that, when placed after the PA, produces a linear output.
- Copying the post-distorter coefficients directly into the predistorter LUT.
This avoids the need to compute a direct inverse model, but assumes commutability that fails when significant memory effects are present.

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.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us