arXiv · 2009.09729
Low-Complexity Massive MIMO Tensor Precoding
Abstract
We present a novel and low-complexity massive multiple-input multiple-output (MIMO) precoding strategy based on novel findings concerning the subspace separability of Rician fading channels. Considering a uniform rectangular array at the base station, we show that the subspaces spanned by the channel vectors can be factorized as a tensor product between two lower dimensional subspaces. Based on this result, we formulate tensor maximum ratio transmit and zero-forcing precoders. We show that the proposed tensor precoders exhibit lower computational complexity and require less instantaneous channel state information than their linear counterparts. Finally, we present computer simulations that demonstrate the applicability of the proposed tensor precoders in practical communication scenarios.
Explore related subjects
Keep this discovery
Lucas N. Ribeiro, Stefan Schwarz, André L. F. de Almeida, Martin Haardt. 2020-09-21. Low-Complexity Massive MIMO Tensor Precoding. https://arxiv.org/abs/2009.09729
Cite the original work for its findings. Save a collection to share your selection of sources.