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.
Glossary
Sample-by-Sample Update

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.
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.
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.
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.
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.
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).
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.
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.
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.
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.
| Feature | Sample-by-Sample Update | Block Update | Burst 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 |
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.
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
Explore the foundational algorithms and architectures that enable real-time, sample-by-sample adaptation of digital predistortion coefficients.
Stochastic Gradient Descent (SGD)
The core optimization engine for sample-by-sample updates. Instead of accumulating a batch, SGD computes the gradient of the instantaneous squared error and immediately adjusts the DPD coefficients. This makes it highly responsive to dynamic changes in the power amplifier's nonlinearity, though the high variance in the gradient estimate can lead to misadjustment noise.
Least Mean Squares (LMS)
A practical, low-complexity implementation of SGD widely used for online DPD training. The LMS algorithm updates the predistorter coefficients by multiplying the error signal with the regressor vector. Its simplicity makes it ideal for FPGA-based DPD implementation, but its convergence rate is highly sensitive to the eigenvalue spread of the input signal's autocorrelation matrix.
Recursive Least Squares (RLS)
An adaptive filtering algorithm that offers an order of magnitude faster convergence rate than LMS by recursively computing the inverse of the input autocorrelation matrix. This makes RLS highly effective for tracking thermal memory effects that cause rapid coefficient drift, though its higher computational complexity requires careful resource management in real-time systems.
Direct Learning Architecture (DLA)
A closed-loop topology that naturally supports sample-by-sample updates. In DLA, the error between the desired ideal signal and the actual PA output is computed directly, and this error drives the coefficient update. This architecture avoids the model inversion step required by indirect methods and minimizes the accumulation of modeling errors.
Coefficient Drift
A critical failure mode that sample-by-sample updates are designed to prevent. Without continuous adaptation, DPD coefficients deviate from their optimal values due to thermal memory effects, component aging, and supply voltage fluctuations. A robust sample-by-sample loop acts as a control system, constantly nudging coefficients back to the minimum of the cost function.
Misadjustment
The excess mean squared error introduced by the noisy gradient estimates in stochastic gradient descent. In a sample-by-sample update scheme, there is an inherent trade-off: a larger step size accelerates convergence rate but increases misadjustment noise, while a smaller step size yields lower steady-state error but may fail to track rapid changes in the PA's nonlinear characteristics.

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