Feb 2026· arXiv.org· Vol abs/2602.04083· 0 citations· 55 references
Computer ScienceEngineering
TL;DR
A structure-informed hybrid estimator formulating pilot-limited MIMO channel estimation as low-rank tensor completion from sparse pilot observations is proposed---an underdetermined inverse problem that prior approaches avoid by assuming fully observed tensors.
Abstract
Accurate channel state information in wideband MIMO systems is constrained by pilot overhead, a challenge intensifying as bandwidths scale toward 6G. This paper proposes a structure-informed hybrid estimator formulating pilot-limited MIMO channel estimation as low-rank tensor completion from sparse pilot observations---an underdetermined inverse problem that prior approaches avoid by assuming fully observed tensors. Canonical polyadic~(CP) and Tucker decompositions are compared: CP excels for specular channels matching its rank-one parameterization exactly, while Tucker provides numerical stability at extreme pilot scarcity where CP exhibits heavy-tail divergence. A lightweight 3D U-Net learns residual components beyond the low-rank structure, compensating for diffuse scattering and hardware non-idealities. On synthetic specular channels, Tucker completion improves normalized mean-squared error (NMSE) by $10.88$~dB over least squares and $7.83$~dB over orthogonal matching pursuit at $10\%$ pilot density ($\rho$); CP outperforms Tucker by $13.11$~dB at SNR=20~dB. On DeepMIMO channels, the hybrid Tensor--NN estimator has two regimes: Tensor--NN(Tucker) remains stable at $\rho=2\%$ where CP diverges, while a CP-guided variant becomes best from $\rho\ge 4\%$, reaching $-16.44$~dB at $\rho=8\%$ and $-20.34$~dB at $\rho=20\%$. The Tucker-guided variant outperforms unconstrained deep learning across the full pilot range; the CP-guided variant widens this gap once stable. Empirical analysis confirms sample complexity scales with intrinsic channel dimensionality (dominant paths) rather than ambient tensor size.
The results show that sparse recovery exploits the assumed delay-domain sparsity more effectively than non-sparse baselines in the underdetermined regime, while pilot density remains a dominant factor in support identification and reconstruction error.
Juan Inga, Elias Yaacoub, M. Al-Ali et al.· Electronics· 0 citations
Low-complexity channel state information acquisition is crucial for extremely large-scale multiple-input multiple-output (XL-MIMO) systems. However, practical deployments of non-square uniform planar arrays (UPAs) in hybrid-field environments face prohibitive computational complexity and degraded estimation accuracy du...
Yi-Long Liu, Xi Yang, Bing-Gui Zhou et al.· arXiv.org· 0 citations
This work proposes a Gaussian mixture model (GMM)-based prediction framework for MIMO-orthogonal frequency-division multiplexing channels under partial feedback using Gram-square-root factorization, and introduces an efficient parameter reduction technique that exploits structured covariance matrices, significantly low...
Kathrin Klein, Amar Kasibovic, M. Joham et al.· 0 citations
The study aims to develop a resource-efficient method for blind channel estimation that is invariant to antenna array topology, with the goal of minimizing signaling overhead and maximizing throughput capacity under conditions of complex spatial correlation.
Cong Quyen Pham, E. Glushankov· Infokommunikacionnye tehnolo...· 0 citations
TAP is a one-shot neural framework that unifies the speed of DL with the mathematical interpretability of CS, replacing iterative pursuit with a lightweight 1D neural network that extracts dominant continuous propagation delays from temporal channel sequences via a differentiable sub-grid interpolation operator.
Minwoo Kim, Hyeonsu Lyu, Sehyun Ryu et al.· 0 citations
Experiments show that the proposed approach achieves spectral efficiency close to exact SVD-based beamforming in single-stream transmission and consistently improves multi-stream sum-rate over representative learned baselines, indicating good scalability for low-latency wireless processing.
Yue Zhang, Yi-Yan Zhang, Rui-Jin Sun et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
With $2.1 million funding from Google.org, the open-source Public Transit Intelligence Hub will unify public transit monitoring, operations, and passenger communication.