Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2603.28918 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912989869768704 |
|---|---|
| author | Şenyuva, Rıfat Volkan |
| author_facet | Şenyuva, Rıfat Volkan |
| contents | Near-field propagation in extremely large aperture arrays requires joint angle-range estimation. In hybrid architectures, only $N_\mathrm{RF}\ll M$ compressed snapshots are available per slot, making the $N_\mathrm{RF}\times N_\mathrm{RF}$ compressed sample covariance the natural sufficient statistic. We propose the Curvature-Learning KL (CL-KL) estimator, which grids only the angle dimension and \emph{learns the per-angle inverse range} directly from the compressed covariance via KL divergence minimisation. CL-KL uses a $Q_θ$-element dictionary instead of the $Q_θQ_r$ atoms of 2-D polar gridding, eliminating the range-dimension dictionary coherence that plagues polar codebooks in the strong near-field regime, and operates entirely on the compressed covariance for full compatibility with hybrid front-ends. At $N_\mathrm{MC}=400$ ($f_c=28$~GHz, $M=64$, $N_\mathrm{RF}=8$, $N=64$, $d=3$, $r\in[0.05,1.0]\,r_\mathrm{RD}$), CL-KL achieves the lowest channel NMSE among all six evaluated methods -- including four full-array baselines using $64\times$ more data -- at $\mathrm{SNR}\in\{-5,0,+5,+10\}$~dB. Running in approximately 70~ms per trial (vs.\ 5~ms for the compressed-domain peer P-SOMP), CL-KL's dominant cost is the $N_\mathrm{RF}{\times}N_\mathrm{RF}$ inversion rather than $M$: measured runtime stays near 70~ms across $M\in\{32,64,128,256\}$, making it aperture-scalable for XL-MIMO deployments. CL-KL is further validated against a derived compressed-domain Cramér-Rao bound and confirmed robust to non-Gaussian (QPSK) source distributions, with a maximum NMSE gap below 0.6~dB. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_28918 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Covariance-Domain Near-Field Channel Estimation under Hybrid Compression: USW/Fresnel Model, Curvature Learning, and KL Covariance Fitting Şenyuva, Rıfat Volkan Signal Processing Information Theory Near-field propagation in extremely large aperture arrays requires joint angle-range estimation. In hybrid architectures, only $N_\mathrm{RF}\ll M$ compressed snapshots are available per slot, making the $N_\mathrm{RF}\times N_\mathrm{RF}$ compressed sample covariance the natural sufficient statistic. We propose the Curvature-Learning KL (CL-KL) estimator, which grids only the angle dimension and \emph{learns the per-angle inverse range} directly from the compressed covariance via KL divergence minimisation. CL-KL uses a $Q_θ$-element dictionary instead of the $Q_θQ_r$ atoms of 2-D polar gridding, eliminating the range-dimension dictionary coherence that plagues polar codebooks in the strong near-field regime, and operates entirely on the compressed covariance for full compatibility with hybrid front-ends. At $N_\mathrm{MC}=400$ ($f_c=28$~GHz, $M=64$, $N_\mathrm{RF}=8$, $N=64$, $d=3$, $r\in[0.05,1.0]\,r_\mathrm{RD}$), CL-KL achieves the lowest channel NMSE among all six evaluated methods -- including four full-array baselines using $64\times$ more data -- at $\mathrm{SNR}\in\{-5,0,+5,+10\}$~dB. Running in approximately 70~ms per trial (vs.\ 5~ms for the compressed-domain peer P-SOMP), CL-KL's dominant cost is the $N_\mathrm{RF}{\times}N_\mathrm{RF}$ inversion rather than $M$: measured runtime stays near 70~ms across $M\in\{32,64,128,256\}$, making it aperture-scalable for XL-MIMO deployments. CL-KL is further validated against a derived compressed-domain Cramér-Rao bound and confirmed robust to non-Gaussian (QPSK) source distributions, with a maximum NMSE gap below 0.6~dB. |
| title | Covariance-Domain Near-Field Channel Estimation under Hybrid Compression: USW/Fresnel Model, Curvature Learning, and KL Covariance Fitting |
| topic | Signal Processing Information Theory |
| url | https://arxiv.org/abs/2603.28918 |