Search arXivSearch

arXiv · 2609.00937

Exact Payload-Decoupling Conditions for Pilot-Only BEM Channel Estimation With Application to OTFS

Abstract

In high-mobility doubly dispersive links, basis expansion models (BEMs) reduce channel dimensionality, yet unknown payload symbols generally contaminate conventional matched-pilot channel estimates. This paper establishes the exact conditions under which such estimates become payload-independent and derives a pilot, guard, and data-placement rule that guarantees these conditions. We prove a necessary-and-sufficient zero pilot--data interference (ZPDI) condition under which the matched-pilot least-squares (LS) solution coincides with the maximum-likelihood (ML) estimator for the reduced pilot statistic. When ZPDI holds, estimation requires a single precomputed projection. When it does not, the estimate contains a deterministic, channel-scaled payload bias that persists at high signal-to-noise ratio. A disjoint-support rule, independent of the selected basis, realizes ZPDI through pilot, guard, and data placement. We then specialize the framework to orthogonal time--frequency space (OTFS) and examine its structural and performance consequences. With the generalized complex-exponential BEM (GCE-BEM), the ZPDI estimator remains within about $2$~dB of the perfect channel state information benchmark in bit error rate at speeds up to 500~km/h.

Explore related subjects

Keep this discovery

BibTeXRIS

Gianmarco Romano, Francesco A. N. Palmieri, Stefano Buzzi, Giovanni Di Gennaro, Amedeo Buonanno. 2026-09-01. Exact Payload-Decoupling Conditions for Pilot-Only BEM Channel Estimation With Application to OTFS. https://arxiv.org/abs/2609.00937

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

The maximum entropy state

We give an algorithm for calculating the maximum entropy state as the least fixed point of a Scott continuous mapping on the domain of classical states in their Bayesian order.

math.PR

Turing complete Navier-Stokes steady states via cosymplectic geometry

In this article, we construct stationary solutions to the Navier-Stokes equations on certain Riemannian $3$-manifolds that exhibit Turing completeness, in the sense that they are capable of performing universal computation. This universality arises on manifolds admitting nonvanishing harmonic 1-forms, thus showing that computational universality is not obstructed by viscosity, provided the underlying geometry satisfies a mild cohomological condition. The proof makes use of a correspondence between nonvanishing harmonic $1$-forms and cosymplectic geometry, which extends the classical correspondence between Beltrami fields and Reeb flows on contact manifolds.

math.DG

Geometric mean and Lebesgue-type decomposition of completely positive maps

We introduce the geometric mean and the parallel sum of completely positive (CP) maps between von Neumann algebras, based on the Pusz--Woronowicz theory of positive sesquilinear forms. We provide a concrete characterization via a block matrix positivity condition and establish their fundamental properties, including the AM--GM--HM inequality with respect to the CP order. In finite-dimensional settings, our construction is compatible with the Choi--Jamiolkowski correspondence, under which the geometric mean of CP maps corresponds to the Kubo--Ando geometric mean of their Choi matrices. This yields a natural operator-theoretic framework for interpolating quantum channels. As an application, we obtain index-type inequalities for conditional expectations in subfactor theory. Finally, we establish a Lebesgue-type decomposition of CP maps via a parallel sum construction, thereby providing a unified framework that simultaneously generalizes Ando's decomposition of bounded positive operators and Kosaki's decomposition of normal positive functionals on von Neumann algebras.

math.OA