论文标题
低复杂性大量MIMO张量预编码
Low-Complexity Massive MIMO Tensor Precoding
论文作者
论文摘要
我们提出了一种基于有关里奇亚褪色通道的子空间可分离性的新发现，提出了一种新颖和低复杂性的大量多输入多输出（MIMO）预编码策略。考虑到基站均匀的矩形阵列，我们表明，通道矢量跨越的子空间可以分解为两个较低维子空间之间的张量。基于此结果，我们制定了张量最大比率传输和零孔的预码器。我们表明，所提出的张量预码器的计算复杂性较低，并且所需的瞬时通道状态信息比线性对应物更少。最后，我们提出了计算机模拟，以证明所提出的张量预码器在实际通信方案中的适用性。
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.
