Search arXivSearch

arXiv · 2606.25101

Wideband Near-Field Channel Estimation Under Hybrid Compression: Cross-Subcarrier KL Covariance Fitting With OFDM Fresnel Model

Abstract

We consider wideband channel estimation for extremely large-scale multiple-input multiple-output (XL-MIMO) arrays under hybrid analog-digital compression, in which a uniform linear array (ULA) is observed through far fewer radio-frequency (RF) chains than antennas. At a carrier frequency of 28 GHz with bandwidths reaching several hundred MHz, the standard narrowband polar-domain channel model fails: the near-field Fresnel curvature becomes subcarrier-dependent, and the compressed observation destroys the per-subcarrier spatial covariance structure that narrowband methods exploit. We propose the Wideband Cross-subcarrier Kullback--Leibler (WB-CL-KL) estimator, which jointly estimates angle and range directly from the compressed sample covariance, without full-array reconstruction, by fitting a structured Fresnel covariance model across orthogonal frequency-division multiplexing (OFDM) subcarriers via a cross-subcarrier Kullback--Leibler (KL) divergence criterion. We also derive the wideband compressed-domain Cramér--Rao bound (CRB) -- the performance lower bound for this hybrid architecture -- from the Slepian--Bangs formula, and decompose its gain over the narrowband bound into a data-diversity component of +27.093 dB and a geometric-diversity component of +0.701 dB, totalling +27.793 dB at B = 400 MHz (Propositions 1 and 2). In the single-path line-of-sight regime, WB-CL-KL attains a range root-mean-square error of 19.8 mm against a 19.9 mm bound at signal-to-noise ratio (SNR) = 10 dB, a ratio of 0.996. Under the 3GPP Urban Micro (UMi) path-loss and shadow-fading SNR distribution, it achieves a bound ratio of 0.959 at the median deployment SNR of 9.6 dB, indicating near-CRB operation at the representative deployment point, where the compressed-domain bound is evaluated at the scene-median geometry.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rıfat Volkan Şenyuva. 2026-06-23. Wideband Near-Field Channel Estimation Under Hybrid Compression: Cross-Subcarrier KL Covariance Fitting With OFDM Fresnel Model. https://arxiv.org/abs/2606.25101

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

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT