pith. sign in

arxiv: 2605.26249 · v1 · pith:7LDZSLOMnew · submitted 2026-05-25 · 📡 eess.SP

Blind Channel Estimation and Data Detection for Near-Field XL-MIMO Systems

Maral Safari , Italo Atzeni This is my paper

Pith reviewed 2026-06-29 20:16 UTC · model grok-4.3

classification 📡 eess.SP
keywords blind channel estimationXL-MIMOnear-field propagationdata detectionorthogonal matching pursuitblock coordinate descent
0
0 comments X

The pith

A two-stage blind framework recovers channel-data products from superimposed signals to enable pilot-free detection in near-field XL-MIMO.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a blind channel estimation and data detection method for uplink near-field XL-MIMO systems. It models the received signal as a superposition of user-specific rank-one channel-data products and solves this via polar-domain sparsity. An on-grid B-OMP stage identifies dominant angle-distance components, followed by off-grid BCD refinement of continuous parameters. Numerical comparisons show lower symbol error rates than pilot-based zero-forcing beamforming, with the largest gains at low SNR and when data symbols occupy a small fraction of the coherence interval.

Core claim

The recovery of user-specific rank-one channel-data products from a superimposed received signal is achieved by first applying an on-grid B-OMP algorithm that exploits polar-domain sparsity to iteratively identify the dominant angle-distance components and estimate the corresponding products, then applying an off-grid BCD stage that optimizes the angle and distance parameters in the continuous polar domain.

What carries the argument

B-OMP algorithm that uses polar-domain sparsity to identify dominant angle-distance components and estimate channel-data products, followed by BCD refinement in the continuous domain.

If this is right

  • Symbol error rate decreases relative to pilot-based zero-forcing beamforming.
  • Gains are largest at low signal-to-noise ratio.
  • Gains increase when the number of data symbols is small compared with the coherence interval length.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The approach could lower the pilot overhead required in high-frequency XL-MIMO deployments.
  • Similar sparsity-exploiting recovery might extend to downlink or multi-cell scenarios with appropriate model adjustments.

Load-bearing premise

The polar-domain sparse channel model together with the low-dimensional data subspace model accurately represent the superimposed received signal.

What would settle it

A numerical experiment in which the true channel deviates from the assumed polar-domain sparsity while keeping the same array size and SNR, after which the proposed method's symbol error rate equals or exceeds that of the pilot-based zero-forcing baseline.

Figures

Figures reproduced from arXiv: 2605.26249 by Italo Atzeni, Maral Safari.

Figure 1
Figure 1. Figure 1: SER versus ρ, with K ∈ {4, 8}, T = 200, S = 16, and M ∈ {16, 32, 64}. Solid and dashed curves correspond to N = 128 and N = 256, respectively. stage in mitigating the grid mismatch effects of the on-grid estimation. Although the primary objective of the proposed B-CE&DD framework is data detection rather than channel estimation, it is still useful to assess the quality of the recovered channels [PITH_FULL… view at source ↗
Figure 2
Figure 2. Figure 2: plots the normalized mean-square error (NMSE) of the channel estimation versus the SNR ρ, with N = 128 antennas, K = 4 users, coherence interval T = 200 symbols, S = 16 data symbols, and 16-QAM. This corresponds to the setting in the top-left sub-figure in [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: SER versus S, with N = 128, T = 600, 16-QAM, and ρ = −5 dB. Solid and dashed curves correspond to K = 6 and K = 8, respectively. 35 40 45 50 55 60 65 70 10−7 10−6 10−5 10−4 10−3 10−2 10−1 100 Number of data symbols S SER OMP+ZF B-OMP B-OMP+BCD [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figure 5
Figure 5. Figure 5: shows the SER versus the length of the coherence interval T, with N = 128 antennas, S ∈ {20, 30} data symbols, SNR ρ = −5 dB, and 16-QAM, where the solid, dashed, and dotted curves correspond to K = 4, K = 6, and K = 8 users, respectively. For a fixed S, the SER achieved by the proposed B-CE&DD framework decreases as T increases, since a larger coherence interval provides more observations for recovering t… view at source ↗
Figure 6
Figure 6. Figure 6: plots the SER versus the normalized system load K S T , with N = 128 antennas, K ∈ {4, 6, 8} users, coherence interval T = 240 symbols, SNR ρ = −5 dB, and 16-QAM, where the solid and dashed curves correspond to S = 20 and S = 30 data symbols, respectively. As expected, the SER resulting from the proposed B-CE&DD framework increases as K S T grows, since a higher load means that more data symbols and/or mor… view at source ↗
Figure 7
Figure 7. Figure 7: SER versus L, with N = 128, K = 8, T = 200, S = 20, ρ = −10 dB, and 16-QAM. with more data symbols per user. Lastly, [PITH_FULL_IMAGE:figures/full_fig_p012_7.png] view at source ↗
read the original abstract

Future wireless systems are expected to employ extremely large-scale multiple-input multiple-output (XL-MIMO) arrays at high carrier frequencies, where near-field propagation makes the channel depend jointly on angle and distance. The resulting short coherence intervals make channel state information acquisition challenging, motivating blind channel estimation and data detection (B-CE-DD). In this paper, we propose a two-stage B-CE-DD framework for uplink near-field XL-MIMO systems. First, we formulate the problem as the recovery of user-specific rank-one channel-data products from a superimposed received signal using a polar-domain sparse channel model and a low-dimensional data subspace model. Building on this formulation, we develop an on-grid blind orthogonal matching pursuit (B-OMP) algorithm that exploits polar-domain sparsity to iteratively identify the dominant angle-distance components and estimate the corresponding channel-data products, followed by an off-grid refinement stage based on block-coordinate descent (BCD) that optimizes the angle and distance parameters in the continuous polar domain. Numerical results show that the proposed B-CE-DD framework combining B-OMP and BCD significantly improves the symbol error rate compared with a pilot-based baseline employing zero-forcing beamforming, particularly at low signal-to-noise ratio and when the number of data symbols is small relative to the length of the coherence interval.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript proposes a two-stage blind channel estimation and data detection (B-CE-DD) framework for uplink near-field XL-MIMO systems. It models the superimposed received signal via a polar-domain sparse channel model and a low-dimensional data subspace model to recover user-specific rank-one channel-data products. The framework consists of an on-grid blind orthogonal matching pursuit (B-OMP) algorithm to identify dominant angle-distance components, followed by an off-grid block-coordinate descent (BCD) refinement stage. Numerical results claim that the B-OMP+BCD combination yields lower symbol error rate than a pilot-based zero-forcing baseline, with the advantage most pronounced at low SNR and when the number of data symbols is small relative to the coherence interval length.

Significance. If the reported SER gains prove robust, the work addresses a practically relevant problem: acquiring CSI with minimal pilot overhead in near-field XL-MIMO deployments that suffer from short coherence intervals. The modeling choices (polar sparsity plus low-dimensional subspace) are explicitly stated and internally consistent with the algorithmic development; the use of standard sparse-recovery tools (OMP followed by continuous refinement) is appropriate. No machine-checked proofs or parameter-free derivations are present, but the numerical comparison to an external baseline is a standard and falsifiable form of evidence.

minor comments (3)
  1. The abstract and introduction state that numerical results demonstrate improvement but provide no information on the number of Monte Carlo trials, exact simulation parameters (array size, carrier frequency, user distances, SNR range), or whether error bars are shown; adding these details would strengthen reproducibility.
  2. The low-dimensional data subspace model is introduced as central to the formulation but its precise dimensionality and how it is chosen from the received signal are not described in the provided summary; a short clarifying paragraph or equation reference would improve clarity.
  3. Ensure that all acronyms (B-OMP, BCD, XL-MIMO, SER) are defined on first use and that figure captions explicitly state the simulation settings used for each plotted curve.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive evaluation of our manuscript and for recommending minor revision. The referee's summary accurately captures the proposed B-CE-DD framework, the B-OMP+BCD algorithm, and the numerical comparisons presented. As the report lists no specific major comments, we have no individual points to address.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper formulates blind channel estimation as recovery of rank-one channel-data products under explicit polar-domain sparsity and low-dimensional subspace modeling assumptions, then develops B-OMP followed by BCD refinement as an algorithmic procedure. Performance is assessed via direct numerical comparison of symbol error rate against an external pilot-based zero-forcing baseline. No derivation step reduces a claimed result to a fitted parameter or self-citation by construction; the central claims remain independent of the modeling choices and are externally falsifiable through the reported simulations.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework rests on domain assumptions about sparsity and subspace structure; no free parameters or invented entities are visible from the abstract.

axioms (2)
  • domain assumption Polar-domain sparse channel model accurately captures near-field XL-MIMO propagation
    Invoked to formulate the recovery problem as recovery of user-specific rank-one products
  • domain assumption Data symbols lie in a low-dimensional subspace
    Used to enable the joint estimation formulation

pith-pipeline@v0.9.1-grok · 5757 in / 1365 out tokens · 20508 ms · 2026-06-29T20:16:18.790279+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

35 extracted references · 1 canonical work pages

  1. [1]

    White paper on broadband connectivity in 6G,

    N. Rajathevaet al., “White paper on broadband connectivity in 6G,”

  2. [2]

    White paper on broadband connectivity in 6G,

    [Online]. Available: https://arxiv.org/abs/2004.14247

    work page arXiv 2004

  3. [3]

    IEEE 802.15.3d: First standardiza- tion efforts for sub-terahertz band communications toward 6G,

    V . Petrov, T. Kurner, and I. Hosako, “IEEE 802.15.3d: First standardiza- tion efforts for sub-terahertz band communications toward 6G,”IEEE Commun. Mag., vol. 58, no. 11, pp. 28–33, 2020

    2020

  4. [4]

    Sub-THz communications: Perspective and results from the Hexa-X-II project,

    I. Atzeniet al., “Sub-THz communications: Perspective and results from the Hexa-X-II project,”IEEE Open J. Commun. Soc., vol. 6, pp. 7495–7540, 2025

    2025

  5. [5]

    6G wire- less communication systems: Applications, requirements, technologies, challenges, and research directions,

    M. Z. Chowdhury, M. Shahjalal, S. Ahmed, and Y . M. Jang, “6G wire- less communication systems: Applications, requirements, technologies, challenges, and research directions,”IEEE Open J. Commun. Soc., vol. 1, pp. 957–975, 2020

    2020

  6. [6]

    Channel estimation for extremely large-scale MIMO: Far-field or near-field?

    M. Cui and L. Dai, “Channel estimation for extremely large-scale MIMO: Far-field or near-field?”IEEE Trans. Commun., vol. 70, no. 4, pp. 2663– 2677, 2022

    2022

  7. [7]

    6G wireless communications: From far-field beam steering to near-field beam focusing,

    H. Zhang, N. Shlezinger, F. Guidi, D. Dardari, and Y . C. Eldar, “6G wireless communications: From far-field beam steering to near-field beam focusing,”IEEE Commun. Mag., vol. 61, no. 4, pp. 72–77, 2023

    2023

  8. [8]

    Seven defining features of terahertz (THz) wireless systems: A fellowship of communication and sensing,

    C. Chaccour, M. N. Soorki, W. Saad, M. Bennis, P. Popovski, and M. Debbah, “Seven defining features of terahertz (THz) wireless systems: A fellowship of communication and sensing,”IEEE Commun. Surveys and Tuts., vol. 24, no. 2, pp. 967–993, 2022

    2022

  9. [9]

    Non-stationarities in extra-large-scale massive MIMO,

    E. de Carvalho, A. Ali, A. Amiri, M. Angjelichinoski, and R. W. Heath, “Non-stationarities in extra-large-scale massive MIMO,”IEEE Wireless Commun., vol. 27, no. 4, pp. 74–80, 2020

    2020

  10. [10]

    A tutorial on near-field XL-MIMO communications toward 6G,

    H. Luet al., “A tutorial on near-field XL-MIMO communications toward 6G,”IEEE Commun. Surveys and Tuts., vol. 26, no. 4, pp. 2213–2257, 2024

    2024

  11. [11]

    Energy and spectral efficiency of very large multiuser MIMO systems,

    H. Q. Ngo, E. G. Larsson, and T. L. Marzetta, “Energy and spectral efficiency of very large multiuser MIMO systems,”IEEE Trans. Commun., vol. 61, no. 4, pp. 1436–1449, 2013

    2013

  12. [12]

    Semi- blind, training, and data-aided channel estimation schemes for MIMO- FBMC-OQAM systems,

    P. Singh, H. B. Mishra, A. K. Jagannatham, and K. Vasudevan, “Semi- blind, training, and data-aided channel estimation schemes for MIMO- FBMC-OQAM systems,”IEEE Trans. Signal Process., vol. 67, no. 18, pp. 4668–4682, 2019

    2019

  13. [13]

    Off-the- grid blind deconvolution and demixing,

    S. Razavikia, S. Daei, M. Skoglund, G. Fodor, and C. Fischione, “Off-the- grid blind deconvolution and demixing,” inProc. IEEE Global Commun. Conf. (GLOBECOM), 2023

    2023

  14. [14]

    Near-field sparse channel representation and estimation in 6G wireless communications,

    X. Zhang, H. Zhang, and Y . C. Eldar, “Near-field sparse channel representation and estimation in 6G wireless communications,”IEEE Trans. Commun., vol. 72, no. 1, pp. 450–464, 2023

    2023

  15. [15]

    Channel estimation for mixed line-of-sight and non-line-of-sight near-field XL-MIMO systems,

    Y . Lu and L. Dai, “Channel estimation for mixed line-of-sight and non-line-of-sight near-field XL-MIMO systems,”IEEE Trans. Wireless Commun., vol. 22, no. 11, pp. 7814–7828, 2023

    2023

  16. [16]

    Performance analysis of a 2D-MUSIC algorithm for parametric near-field channel estimation,

    D. Gürgüno ˘glu, A. Kosasih, P. Ramezani, Ö. T. Demir, E. Björnson, and G. Fodor, “Performance analysis of a 2D-MUSIC algorithm for parametric near-field channel estimation,”IEEE Wireless Commun. Lett., vol. 14, pp. 1496–1500, 2025

    2025

  17. [17]

    A primer on near-field beamforming for arrays and reconfigurable intelligent surfaces,

    E. Björnson, Ö. T. Demir, and L. Sanguinetti, “A primer on near-field beamforming for arrays and reconfigurable intelligent surfaces,” inProc. Asilomar Conf. Signals, Syst., and Comput. (ASILOMAR), 2021

    2021

  18. [18]

    Design of near-field beamforming for large intelligent surfaces,

    S. Hu, H. Wang, and M. C. Ilter, “Design of near-field beamforming for large intelligent surfaces,”IEEE Trans. Wireless Commun., vol. 23, no. 1, pp. 762–774, 2023

    2023

  19. [19]

    Near-field beamfocusing, localization, and channel estimation with modular linear arrays,

    A. Kosasih, Ö. T. Demir, and E. Björnson, “Near-field beamfocusing, localization, and channel estimation with modular linear arrays,”IEEE Trans. Wireless Commun., vol. 25, pp. 8784–8798, 2025

    2025

  20. [20]

    Blind deconvolution using convex programming,

    A. Ahmed, B. Recht, and J. Romberg, “Blind deconvolution using convex programming,”IEEE Trans. Inf. Theory, vol. 60, no. 3, pp. 1711–1732, 2013

    2013

  21. [21]

    Guaranteed blind sparse spikes deconvolution via lifting and convex optimization,

    Y . Chi, “Guaranteed blind sparse spikes deconvolution via lifting and convex optimization,”IEEE J. Sel. Topics Signal Process., vol. 10, no. 4, pp. 782–794, 2016

    2016

  22. [22]

    Rapid, robust, and reliable blind deconvolution via nonconvex optimization,

    X. Liet al., “Rapid, robust, and reliable blind deconvolution via nonconvex optimization,”Appl. Comput. Harmon. Anal., vol. 47, no. 3, pp. 893–934, 2019

    2019

  23. [23]

    Channel estimation in massive MIMO systems,

    D. Neumann, T. Wiese, and W. Utschick, “Channel estimation in massive MIMO systems,”IEEE Signal Process. Mag., vol. 32, no. 6, pp. 90–101, 2015

    2015

  24. [24]

    Blind channel estimation for MIMO OFDM systems via nonredundant linear precoding,

    F. Gao and A. Nallanathan, “Blind channel estimation for MIMO OFDM systems via nonredundant linear precoding,”IEEE Trans. Signal Process., vol. 55, no. 2, pp. 784–789, 2007

    2007

  25. [25]

    Blind estimation of sparse broadband massive MIMO channels with ideal and one-bit ADCs,

    A. Mezghani and A. L. Swindlehurst, “Blind estimation of sparse broadband massive MIMO channels with ideal and one-bit ADCs,”IEEE Trans. Signal Process., vol. 66, no. 1, pp. 199–213, 2017

    2017

  26. [26]

    Blind joint MIMO channel and data estimation based on regularized ML,

    N. Lassami, A. Aïssa-El-Bey, and K. Abed-Meraim, “Blind joint MIMO channel and data estimation based on regularized ML,”Digital Signal Process., vol. 117, p. 103201, 2021

    2021

  27. [27]

    Dual-blind deconvolution for overlaid radar-communications systems,

    E. Vargas, K. V . Mishra, R. Jacome, B. M. Sadler, and H. Arguello, “Dual-blind deconvolution for overlaid radar-communications systems,” IEEE J. Sel. Areas Inf. Theory., vol. 4, pp. 75–93, 2023

    2023

  28. [28]

    Noncoherent OFDM transmission via off-the-grid joint channel and data estimation,

    M. Bigdeli, H. Fathi, I. Valiulahi, and C. Masouros, “Noncoherent OFDM transmission via off-the-grid joint channel and data estimation,”IEEE Commun. Lett., vol. 12, no. 1, pp. 99–103, 2022

    2022

  29. [29]

    Towards a mathematical theory of super-resolution,

    E. J. Candès and C. Fernandez-Granda, “Towards a mathematical theory of super-resolution,”Commun. Pure Appl. Math., vol. 67, no. 6, pp. 906–956, 2014

    2014

  30. [30]

    Off-the-grid recovery of time and frequency shifts with multiple measurement vectors,

    M. Safari, S. Daei, and F. Haddadi, “Off-the-grid recovery of time and frequency shifts with multiple measurement vectors,”Signal Process., vol. 183, p. 108016, 2021

    2021

  31. [31]

    Joint channel and data estimation for multiuser extremely large-scale MIMO systems,

    K. Arai, K. Ishibashi, H. Iimori, P. V . Klaine, and S. Malomsoky, “Joint channel and data estimation for multiuser extremely large-scale MIMO systems,”IEEE Trans. Wireless Commun., vol. 25, pp. 2544–2560, 2026

    2026

  32. [32]

    Regularized gradient descent: A non-convex recipe for fast joint blind deconvolution and demixing,

    S. Ling and T. Strohmer, “Regularized gradient descent: A non-convex recipe for fast joint blind deconvolution and demixing,”Inf. Inference, vol. 8, no. 1, pp. 1–49, 2019

    2019

  33. [33]

    A semi-blind channel estimation method for multiuser multiantenna OFDM systems,

    Y . Zeng and T.-S. Ng, “A semi-blind channel estimation method for multiuser multiantenna OFDM systems,”IEEE Trans. Signal Process., vol. 52, no. 5, pp. 1419–1429, 2004

    2004

  34. [34]

    Inexact block coordinate descent methods with application to the nonnegative matrix factorization,

    S. Bonettini, “Inexact block coordinate descent methods with application to the nonnegative matrix factorization,”IMA J. Num. Anal., vol. 31, no. 4, pp. 1431–1452, 2011

    2011

  35. [35]

    On the convergence of inexact block coordinate descent methods for constrained optimization,

    A. Cassioli, D. Di Lorenzo, and M. Sciandrone, “On the convergence of inexact block coordinate descent methods for constrained optimization,” Eur . J Oper . Res., vol. 231, no. 2, pp. 274–281, 2013

    2013