Structure-Informed Estimation for Pilot-Limited MIMO Channels via Tensor Decomposition
Alexandre Barbosa de Lima
TL;DR
This work addresses the challenge of estimating wideband MIMO channels under pilot scarcity by leveraging a structure-informed approach that combines low-rank tensor completion with neural residual learning. The method exploits the intrinsic multilinear structure of the channel tensor, enabling recovery from sparse pilot observations, and evaluates CP and Tucker decompositions as well as a hybrid Tensor-NN model. Empirical results show 2–12 dB NMSE improvements over baseline methods for synthetic channels and 24–44% additional NMSE reductions on DeepMIMO ray-tracing channels, with sample complexity scaling with the number of dominant paths and subspace dimensions rather than ambient tensor size. The proposed framework offers a scalable, interpretable route to pilot overhead reduction in beyond-5G/6G MIMO systems and provides a foundation for future extensions to time-varying channels and ISAC scenarios.
Abstract
Channel estimation in wideband multiple-input multiple-output (MIMO) systems faces fundamental pilot overhead limitations in high-dimensional beyond-5G and sixth-generation (6G) scenarios. This paper presents a hybrid tensor-neural architecture that formulates pilot-limited channel estimation as low-rank tensor completion from sparse observations -- a fundamentally different setting from prior tensor methods that assume fully observed received signal tensors. A canonical polyadic (CP) baseline implemented via a projection-based scheme (Tucker completion under partial observations) and Tucker decompositions are compared under varying signal-to-noise ratio (SNR) and scattering conditions: CP performs well for specular channels matching the multipath model, while Tucker provides greater robustness under model mismatch. A lightweight three-dimensional (3D) U-Net learns residual components beyond the low-rank structure, bridging algebraic models and realistic propagation effects. Empirical recovery threshold analysis shows that sample complexity scales approximately with intrinsic model dimensionality $L(N_r + N_t + N_f)$ rather than ambient tensor size $N_r N_t N_f$, where $L$ denotes the number of dominant propagation paths. Experiments on synthetic channels demonstrate 10-20\,dB normalized mean-square error (NMSE) improvement over least-squares (LS) and orthogonal matching pursuit (OMP) baselines at 5-10\% pilot density, while evaluations on DeepMIMO ray-tracing channels show 24-44\% additional NMSE reduction over pure tensor-based methods.
