Search arXiv⌕ Search

arXiv · 2610.33663

Fixed pilot sequences can overstate the gains of learned MIMO-OFDM receivers under power amplifier distortion

Abstract

Neural-network receivers are proposed to undo the distortion of a power amplifier driven close to saturation, where it is most efficient. They estimate the channel from pilots, known symbols sent in every frame. The pilots pass through the same amplifier as the data, so the channel estimate carries a small error that depends on the pilot sequence. If one sequence is always sent, as by default in the Sionna simulator, the error never changes, and a network can learn it instead of undoing the amplifier. We tested this in simulated two- and four-antenna orthogonal frequency-division multiplexing links; results are for binary pilots at the highest signal-to-noise ratio tested. A network with separate weights for each subcarrier lowered the bit error rate by 14 to 22% with its training pilot but raised it by 2 to 18% with every other pilot tested, and longer training widened this gap. A convolutional neural receiver following an open-source tutorial gained 37 percentage points more on its training pilot than on unseen pilots after short training, and 9 points more after nine times longer training, much of which also appeared with a linear amplifier. The gap shrank with amplifier back-off but persisted where the in-band distortion meets the 5G limit. On a channel with short delay spread, smoothing the channel estimate across subcarriers without training lowered the error rate on all 107 pilot sequences tested, by 30% on average. Learned receivers should therefore be tested on unseen pilots and against such simple baselines.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammad Tasin, Al Imran. 2026-10-24. Fixed pilot sequences can overstate the gains of learned MIMO-OFDM receivers under power amplifier distortion. https://arxiv.org/abs/2610.33663

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Hardware-Accelerated Geometrical Simulation of Biological and Engineered In-Air Ultrasonic Systems

The deployment of in-air acoustic sensors for industrial monitoring and autonomous robotics has grown significantly, often drawing inspiration from biological echolocation. However, developing and validating these systems in existing simulation frameworks remains challenging due to the computational cost of simulating high-frequency wave propagation in large, dynamic, and complex environments. While wave-based methods offer high accuracy, they scale poorly with frequency and volume. Conversely, existing geometric acoustic solvers often lack support for dynamic scenes, complex diffraction, or closed-loop robotic integration. In this work, we introduce SonoTraceUE, a high-fidelity acoustic simulation framework built as a plugin for Unreal Engine. By using a hardware-accelerated ray tracing-based specular reflection model, and a curvature-based Monte Carlo diffraction model, the system enables near real-time simulation of active and passive acoustic sensing in dynamic, multi-material environments. We validate the framework through two distinct experimental domains: a bioacoustic study and a robotics experiment. Our results demonstrate that SonoTraceUE achieves high correlation with real-world spectral and spatial data. The framework provides a versatile platform for synthetic data generation, hypothesis testing in bioacoustics, and the rapid prototyping of closed-loop robotic systems that use acoustic sensing.

eess.SP↗

Active MIMO Sensing: Optimality Conditions and Exploration-Exploitation Tradeoff

This paper develops an active sensing framework for designing the transmit and receive beamformers of a multiple-input multiple-output (MIMO) radar system with a limited number of radio-frequency (RF) chains. In the proposed framework, the transmit and receive beamformers are adaptively designed in each sensing stage based on the measurements made in the previous sensing stages, and the optimization of the beamformers are based on the minimization of the Bayesian Cram{é}r-Rao bound (BCRB) for estimating the unknown sensing parameters. To address the exploration-exploitation tradeoff inherent in such an adaptive procedure, this paper proposes a two-phase design involving two variants of the BCRB optimization problem: an exploration-centric variant that requires multiple orthogonal beamforming directions to be probed in each sensing stage, followed by an exploitation-centric variant that optimizes the per-stage BCRB without such requirement. For both variants, the transmit and receive beamformers are optimized as two subproblems in an alternating fashion in each sensing stage. The alternating optimization is shown to converge to a stationary point of the per-stage BCRB optimization provided that each subproblem is solved to global optimality. A main contribution of this paper is to determine sufficient conditions under which global optimality can be guaranteed---despite that the two subproblems are nonconvex (due to the limited number of RF chains), by studying the structures of their optimal solutions via Lagrangian dual analysis. The conditions pertain to the multiplicity of the eigenvalues of specific direction matrices that can be analytically written in terms of the optimal dual variables. Simulation results demonstrate the advantages of the proposed design framework as compared to state-of-the-art adaptive beamforming strategies.

eess.SP↗

BFLA: Block-Filtered Long-Context Attention Mechanism

We propose Block-Filtered Long-Context Attention (BFLA), a training-free sparse prefill method that combines deterministic Lightning-style block indexing, query-tile sharing, and length-adaptive Ratio-$K$ selection with block-sparse execution. BFLA evaluates attention using the original Q/K/V, requires no retraining or per-model parameter retuning, and integrates with vLLM while preserving native decoding. For fixed Q/K/V, we bound local attention-output error in terms of the omitted attention mass, indexer-score distortion, retention budget, and query-tile sharing. Evaluations on Gemma4-E4B-IT, Qwen3.6-27B, Qwen3.8-27B, and Qwen3.8-Flash-Next across LongBench-v2, RULER, InfiniteBench, and Terminal Bench 2.1 show BFLA matches or even outperforms dense baselines. BFLA shows up to approximately $4\times$ time-to-first-token and $3.72\times$ end-to-end request speedups over the corresponding dense-prefill baselines. Comparisons with state-of-the-art FlashPrefill V2 and Qwen Sparse Attention also demonstrate that BFLA has better performance and efficiency trade-offs. These findings highlight the value of BFLA for the acceleration of long-context serving. Project website: https://github.com/Alicewithrabbit/BFLA.

eess.SP↗