Structure-Informed Estimation for Pilot-Limited MIMO Channels via Tensor Decomposition
Alexandre Barbosa de Lima
Aug 2026
Artificial Intelligence
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.
Investigating how experienced developers use agents in building software, including their motivations, strategies, task suitability, and sentiments finds that while experienced developers value agents as a productivity boost, they retain their agency in software design and implementation out of insistence on fundamental software quality attributes.
This systematic review evaluates 55 studies from 2017 to 2023 on the application of machine learning techniques to ASD, highlighting key challenges and opportunities, particularly the need for models that can integrate complex data to improve diagnostic accuracy and treatment outcomes.
Rafael Muñoz-Terol, Jesús Peral, Sandra Amador et al.· Heliyon· 4 citations· ⚡1
This paper identifies two different routes through which models can acquire geometrically separable features: they can learn them from complementary co-occurrence signals in general language data, including text-number co-occurrence and cross-number interaction, or from multi-token addition problems.
A novel quantum generative model for synthesizing tabular data by proposing a quantum generative adversarial network architecture with flexible data encoding and a novel quantum circuit ansatz for effectively modeling tabular data is introduced.
P. Bhardwaj, Caitlin Jones, Lasse Dierich et al.· Scientific Reports· 2 citations
This survey model agent state as a dynamic graph, where memories, tools, skills, workflows, and inter-agent relations are represented as typed nodes, edges, and subgraphs updated through schema-constrained rewrites to provide a compact structural lens for designing and governing self-evolving agents.
Yuanyuan Xu, Wenjie Zhang, Yin Chen et al.· 2 citations