Inferensys

Glossary

Non-Uniform LUT

A look-up table with variable spacing between entries, allocating higher density in regions of rapid amplifier gain compression to optimize correction accuracy.
Elegant overhead shot of a polished wooden communal table in a sun-drenched WeWork lounge, laptops and tablets displaying AI workflow dashboards, plants and pendant lights in background.
ADAPTIVE RESOLUTION MAPPING

What is Non-Uniform LUT?

A look-up table architecture that optimizes correction accuracy by varying the spacing between stored entries, concentrating resolution in regions of rapid amplifier nonlinearity.

A Non-Uniform LUT is a predistortion look-up table where the spacing between adjacent entries is deliberately varied across the input signal's dynamic range. Unlike uniform tables with fixed step sizes, it allocates a higher density of entries in regions where the power amplifier exhibits rapid gain compression or sharp AM-PM phase transitions, maximizing correction fidelity where the nonlinearity is most severe.

This architecture reduces total memory requirements compared to a high-resolution uniform table by avoiding wasted entries in linear operating regions. The non-uniform spacing is typically derived from the amplifier's AM-AM characteristic derivative, with indexing logic using a piecewise linear or polynomial mapping function to translate the input envelope to the appropriate memory address.

ADAPTIVE RESOLUTION MAPPING

Key Characteristics of Non-Uniform LUTs

Non-uniform look-up tables optimize correction accuracy by allocating higher entry density in regions of rapid amplifier gain compression, where linearity is most critical.

01

Variable Step Spacing

Unlike uniform tables with fixed intervals, non-uniform LUTs employ variable spacing between adjacent entries. The spacing is compressed in the gain compression region near saturation, where the amplifier's AM-AM and AM-PM characteristics change most rapidly. In the linear region, spacing expands to conserve memory. This adaptive resolution ensures that the LUT granularity is proportional to the local derivative of the amplifier's transfer function, minimizing LUT interpolation error without increasing total table size.

02

Companding Indexing Function

The core mechanism is a companding function that maps the uniform input signal envelope to a non-uniform address space. Common implementations include:

  • μ-law and A-law companding: Borrowed from telephony, these logarithmic functions densely pack entries at high amplitudes.
  • Polynomial-based warping: Custom polynomials fitted to the amplifier's gain curve derivative.
  • Piecewise linear segmentation: Dividing the dynamic range into segments with different linear slopes. This mapping is applied before LUT addressing, effectively acting as a pre-distortion of the index itself.
03

Memory Efficiency vs. Accuracy

A non-uniform LUT achieves equivalent linearization performance to a much larger uniform table. For example, a 64-entry non-uniform table with μ-law spacing can match the adjacent channel leakage ratio (ACLR) improvement of a 256-entry uniform table. This 4:1 compression ratio directly reduces FPGA block RAM utilization and power consumption. The trade-off is increased complexity in the LUT addressing logic, which must compute the companding function in real-time or use a small secondary mapping table.

04

Adaptation in Non-Uniform Space

When using LMS LUT update algorithms, the adaptation must account for the non-uniform spacing. Standard LMS assumes equal step sizes; applying it directly causes uneven convergence rates. Solutions include:

  • Normalized LMS: Scaling the step size inversely proportional to the local entry density.
  • Interpolation-aware adaptation: Distributing the error update to multiple neighboring entries based on interpolation weights.
  • Virtual uniform adaptation: Performing coefficient updates in a virtual uniform space, then resampling to the non-uniform grid. These techniques ensure stable LUT convergence across all power levels.
05

Hardware Implementation Considerations

Implementing non-uniform LUTs in FPGA-based DPD requires careful pipelining. The companding function can be implemented via:

  • Piecewise linear approximation: Using a small number of comparators and multipliers for real-time warping.
  • Pre-computed mapping ROM: A small uniform LUT that translates the quantized input magnitude to the non-uniform address.
  • CORDIC-based logarithmic conversion: For μ-law implementations, leveraging existing CORDIC hardware. The LUT interpolation block (typically linear or quadratic) must also operate on the non-uniformly spaced entries, requiring the local spacing value as an additional input.
06

Application to Doherty Amplifiers

Doherty amplifier optimization particularly benefits from non-uniform LUTs. The Doherty architecture exhibits a sharp gain compression inflection point at the transition from the carrier to peaking amplifier (typically 6 dB back-off). A non-uniform LUT can concentrate entries precisely around this AM-AM and AM-PM discontinuity, while using sparse spacing elsewhere. This targeted resolution is critical for correcting the complex nonlinearity of wideband signal linearization in modern 5G base stations, where Doherty PAs are ubiquitous.

NON-UNIFORM LUT ESSENTIALS

Frequently Asked Questions

Clear answers to the most common questions about non-uniform look-up table architectures, their implementation trade-offs, and their role in optimizing digital predistortion accuracy.

A non-uniform LUT is a look-up table where the spacing between adjacent entries varies across the input dynamic range, allocating higher LUT granularity in regions of rapid amplifier nonlinearity. Unlike a uniform LUT that spaces entries at equal amplitude intervals, a non-uniform LUT concentrates entries where the power amplifier's AM-AM and AM-PM characteristics change most sharply—typically near the compression region. This variable spacing optimizes correction accuracy without increasing total memory footprint. The indexing function becomes nonlinear, often using a companding or piecewise mapping scheme, to translate the input envelope to the appropriate non-uniformly spaced address. The result is significantly reduced LUT interpolation error and LUT quantization error in critical operating regions while maintaining efficient hardware utilization.

LUT ARCHITECTURE COMPARISON

Non-Uniform LUT vs. Uniform LUT

Structural and performance comparison between uniform and non-uniform look-up table spacing strategies for digital predistortion.

FeatureUniform LUTNon-Uniform LUT

Entry Spacing

Constant step size across entire input range

Variable step size; denser in compression region

Addressing Logic

Simple linear mapping; single multiplier

Piecewise or comparator-based; higher complexity

Memory Efficiency

Wastes entries in linear region

Allocates entries where nonlinearity is highest

Correction Accuracy at Saturation

Lower; coarse resolution near compression

Higher; fine resolution precisely at compression knee

Hardware Complexity

Low; uniform address calculation

Moderate; requires non-linear indexing logic

Interpolation Error

Higher in compression region for same table size

Minimized by concentrating entries at high gradient zones

Adaptation Convergence

Uniform convergence speed across all entries

Faster convergence in dense regions; slower in sparse

Typical ACLR Improvement

Baseline for given table size

+2 to +5 dB additional ACLR for same memory footprint

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.