A Cross-Term Memory Polynomial is a behavioral model structure that extends the standard memory polynomial by incorporating cross-terms between the complex baseband signal and its envelope-dependent products at different time delays. These cross-terms, which include both lagging and leading memory contributions, enable the model to capture strong nonlinear memory effects that diagonal-only Volterra kernels cannot represent, making it particularly effective for wideband power amplifiers where memory effects span multiple symbol periods.
Glossary
Cross-Term Memory Polynomial

What is Cross-Term Memory Polynomial?
A Cross-Term Memory Polynomial (CTMP) is an enriched behavioral model that augments the standard memory polynomial with lagging and leading envelope cross-terms to capture complex nonlinear memory effects in power amplifiers.
The model is defined by augmenting the generalized memory polynomial with additional cross-term branches that multiply delayed signal samples by the envelope of samples at different time lags. This structure bridges the gap between the computationally efficient memory polynomial and the full Volterra series, offering a practical trade-off between modeling accuracy and coefficient complexity for digital predistortion applications in modern wireless transmitters.
Key Features of Cross-Term Memory Polynomial
The Cross-Term Memory Polynomial (CTMP) enriches the standard memory polynomial by introducing lagging and leading envelope cross-terms, enabling it to capture complex nonlinear memory effects that simpler models miss.
Envelope Cross-Term Structure
The defining feature of the CTMP is the inclusion of terms of the form:
x(n-m) ยท |x(n-m-l)|^k
These terms multiply a delayed signal sample by the envelope power of another delayed sample, capturing the interaction between the signal's instantaneous value and its past or future amplitude. This allows the model to represent nonlinear memory effects where the distortion at time n depends on the signal's envelope at a different time instant.
Lagging vs. Leading Cross-Terms
CTMP introduces two distinct cross-term types:
- Lagging cross-terms (
l > 0): The envelope term is further in the past than the signal term, modeling how past envelope values influence current distortion. - Leading cross-terms (
l < 0): The envelope term is closer to the present than the signal term, capturing precursor memory effects often observed in wideband power amplifiers.
This bidirectional temporal modeling significantly improves accuracy over the unidirectional memory polynomial.
Generalized Memory Polynomial (GMP) Foundation
The CTMP is a specific formulation within the broader Generalized Memory Polynomial framework. The GMP extends the memory polynomial by adding:
- Type 1 terms: Signal and envelope delays are independent.
- Type 2 terms: Envelope of the delayed signal multiplied by a further delayed signal.
The CTMP typically focuses on a subset of these cross-terms to balance modeling accuracy with computational complexity, making it suitable for real-time digital predistortion applications.
Coefficient Extraction via Least Squares
Despite its nonlinear structure, the CTMP is linear in its coefficients. This means the predistorter coefficients can be extracted using the Least Squares (LS) algorithm:
- Construct a basis function matrix where each column represents a specific cross-term evaluated over the training data.
- Solve for the coefficient vector using the pseudo-inverse of the basis matrix.
This closed-form solution avoids the iterative training and local minima issues associated with neural network-based predistorters.
Spectral Regrowth Suppression
The primary benefit of CTMP's enhanced modeling capability is superior Adjacent Channel Leakage Ratio (ACLR) improvement. By accurately capturing the nonlinear memory mechanisms that cause spectral regrowth, a CTMP-based predistorter can:
- Achieve 5-10 dB better ACLR than a standard memory polynomial for wideband signals.
- Effectively linearize Doherty and envelope tracking PAs that exhibit strong memory effects.
- Maintain performance across varying signal bandwidths without retraining.
Computational Complexity Trade-off
The improved accuracy of the CTMP comes at the cost of increased basis function count. The number of terms grows with:
- Memory depth (M): Number of taps in the delay line.
- Nonlinearity order (K): Highest polynomial order.
- Cross-term span (L): Range of lagging/leading indices.
Careful selection of these parameters is critical for FPGA implementation, where the number of multiply-accumulate operations per sample must fit within the device's DSP slice budget and timing constraints.
Cross-Term Memory Polynomial vs. Related Models
Structural comparison of the Cross-Term Memory Polynomial against standard and generalized memory polynomial models for capturing nonlinear memory effects in power amplifier behavioral modeling.
| Feature | Memory Polynomial (MP) | Generalized Memory Polynomial (GMP) | Cross-Term Memory Polynomial (CTMP) |
|---|---|---|---|
Kernel Structure | Diagonal terms only | Diagonal + lagging/leading envelope cross-terms | Diagonal + lagging/leading signal cross-terms between delayed samples |
Nonlinearity Order Handling | Odd-order only (typical) | Odd and even order | Odd and even order |
Memory Depth Modeling | Standard tapped delay line | Extended with envelope-dependent memory | Extended with signal cross-term memory |
Coefficient Count (M=5, K=7) | ~35 coefficients | ~105 coefficients | ~140 coefficients |
NMSE Improvement vs. MP (typical) | Baseline | 3-5 dB improvement | 5-8 dB improvement |
Numerical Stability | High (well-conditioned) | Moderate | Moderate to low (requires regularization) |
FPGA Implementation Complexity | Low | Moderate | High |
Suitable for Strong Memory Effects |
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.
Frequently Asked Questions
Essential questions and answers about the cross-term memory polynomial (CTMP) model, its structure, advantages, and implementation for power amplifier behavioral modeling and digital predistortion.
A cross-term memory polynomial (CTMP) is an enhanced behavioral model that extends the standard memory polynomial by incorporating lagging and leading envelope cross-terms to more accurately capture the complex nonlinear memory effects of a power amplifier. The model works by augmenting the diagonal Volterra kernel terms of a memory polynomial with additional basis functions that multiply a delayed signal sample by the complex envelope magnitude of a differently delayed sample. This mathematical structure allows the CTMP to represent the interaction between a signal's instantaneous amplitude and its past or future values, which is critical for modeling long-term thermal memory effects and charge trapping phenomena in GaN and GaAs transistors. The cross-terms effectively capture the modulation of a PA's nonlinear behavior by the signal's envelope history, providing significantly higher modeling fidelity than a standard memory polynomial with fewer coefficients than a full Volterra series.
Related Terms
Explore the foundational behavioral models and neural network architectures that extend or are directly compared against the Cross-Term Memory Polynomial for power amplifier linearization.

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