Inferensys

Glossary

Sample-by-Sample Update

An online learning strategy where digital predistortion (DPD) coefficients are recalculated incrementally with each new incoming signal sample, enabling real-time adaptation to changing power amplifier nonlinearities.
Strategy workshop with sticky notes and AI roadmap diagrams on glass wall, collaborative planning session.
ONLINE LEARNING STRATEGY

What is Sample-by-Sample Update?

An online learning strategy where DPD coefficients are recalculated incrementally with each new incoming signal sample, enabling real-time adaptation to rapidly changing power amplifier nonlinearities.

A sample-by-sample update is an online learning strategy in digital predistortion where the predistorter coefficients are recalculated incrementally with each new incoming signal sample. Unlike block-based methods that accumulate data before processing, this approach applies an instantaneous gradient correction—typically via stochastic gradient descent (SGD) or recursive least squares (RLS)—to minimize the error between the desired linear output and the observed PA output on a per-sample basis.

This strategy offers the fastest possible convergence rate for tracking time-varying nonlinearities caused by thermal drift, supply voltage fluctuations, or rapid envelope changes. However, the per-sample computation imposes stringent latency constraints, requiring highly optimized hardware implementations. The trade-off involves higher misadjustment noise due to gradient variance, which can be mitigated through momentum terms or adaptive step-size normalization.

Online Learning Dynamics

Key Characteristics of Sample-by-Sample Updates

Sample-by-sample updating is a foundational online learning strategy where digital predistortion (DPD) coefficients are recalculated incrementally with each new incoming signal sample, enabling real-time adaptation to rapidly changing power amplifier (PA) nonlinearities.

01

Instantaneous Gradient Descent

The core mechanism relies on stochastic gradient descent (SGD) applied at the sample level. For each new complex baseband sample pair (input and observed output), the instantaneous gradient of a cost function—typically the squared error magnitude—is computed. The predistorter coefficients are then adjusted by a small step in the negative gradient direction. This eliminates the latency associated with block accumulation, allowing the system to track thermal memory effects and dynamic power supply variations within microseconds.

02

Convergence vs. Misadjustment Trade-off

A critical design tension exists between convergence rate and steady-state misadjustment. A larger step size (learning rate) enables rapid acquisition of the PA's inverse characteristic during abrupt operational changes, such as a sudden carrier frequency hop. However, this amplifies gradient noise, causing the coefficients to jitter around the Wiener optimum. This excess error manifests as residual error vector magnitude (EVM) and incomplete adjacent channel power ratio (ACPR) suppression.

03

Computational Complexity per Sample

The arithmetic budget per sample is strictly bounded by the system's sampling rate. For a 100 MHz 5G NR carrier, the update must complete within 10 nanoseconds. This mandates highly optimized, low-latency implementations:

  • Look-Up Table (LUT) Adaptation: Updating a single LUT entry based on the instantaneous input magnitude.
  • Simplified Polynomials: Using a memory polynomial with a very small number of taps.
  • LMS Variants: Employing the simplest Least Mean Squares update, avoiding matrix inversions required by Recursive Least Squares (RLS).
04

Numerical Stability and Coefficient Drift

Continuous, uncorrelated updates make the system susceptible to coefficient drift in the absence of persistent excitation. If the input signal has a low peak-to-average power ratio (PAPR) for an extended period, the gradient estimates become biased, and coefficients can wander toward unstable regions. Mitigation strategies include Tikhonov regularization (leakage) in the update equation, which gently biases coefficients toward zero, and periodic re-centering based on a more robust, slower background block update loop.

05

Tracking Non-Stationary PA Behavior

The primary advantage over block update or burst training methods is the ability to track non-stationary distortion in real-time. This is critical for compensating thermal memory effects where the PA's gain and phase shift vary with the instantaneous die temperature. As the envelope power fluctuates, the sample-by-sample update continuously re-linearizes the transmitter, preventing spectral regrowth spikes that occur when a static predistorter lags behind the PA's changing thermal state.

06

Integration with Direct Learning Architecture (DLA)

Sample-by-sample updating is the natural execution mode for a closed-loop Direct Learning Architecture (DLA). In DLA, the error is formed directly between the desired ideal signal and the actual PA output. This instantaneous error drives the coefficient update without the intermediate step of training a separate postdistorter as in Indirect Learning Architecture (ILA). The result is a single, unified adaptive loop that directly minimizes the in-band and out-of-band distortion power.

UPDATE STRATEGY COMPARISON

Sample-by-Sample vs. Block Update DPD Training

Comparison of coefficient update granularity strategies for online digital predistortion training, highlighting trade-offs in convergence speed, computational load, and tracking capability.

FeatureSample-by-Sample UpdateBlock UpdateBurst Training

Update Trigger

Every individual sample

After N accumulated samples

During dedicated training intervals

Convergence Speed

Fastest (instantaneous gradient)

Moderate (averaged gradient)

Slowest (scheduled updates)

Computational Load per Update

Low (single-sample gradient)

High (batch matrix inversion)

High (batch processing)

Tracking of Time-Varying PA Nonlinearity

Numerical Stability

Moderate (gradient noise)

High (averaging reduces noise)

High (offline precision)

Steady-State Misadjustment

Higher (stochastic gradient noise)

Lower (averaged estimation)

Lowest (batch optimal)

Typical Algorithm

LMS, SGD, RLS

Block LS, QR-RLS

Batch LS, Levenberg-Marquardt

Suitable for Rapidly Changing Signals

SAMPLE-BY-SAMPLE UPDATE

Frequently Asked Questions

Explore the mechanics of sample-by-sample coefficient updates, a critical online learning strategy for adaptive digital predistortion that recalculates parameters with each new data point to track rapidly changing power amplifier nonlinearities.

A sample-by-sample update is an online learning strategy where the coefficients of the digital predistorter (DPD) are recalculated incrementally with each new incoming baseband signal sample. Unlike block-based methods that wait to accumulate a buffer of data, this approach applies an iterative optimization algorithm—typically Least Mean Squares (LMS) or Stochastic Gradient Descent (SGD)—immediately upon the arrival of a single (x, y) pair. This provides the fastest possible adaptation rate, allowing the DPD to track transient thermal memory effects and rapid gain fluctuations in the power amplifier (PA) on a microsecond timescale.

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.