...
首页> 外文期刊>IEEE communications letters >Low-Complexity SSOR-Based Precoding for Massive MIMO Systems
【24h】

Low-Complexity SSOR-Based Precoding for Massive MIMO Systems

机译:适用于大规模MIMO系统的基于低复杂度基于SSOR的预编码

获取原文
获取原文并翻译 | 示例
           

摘要

With the increase of the number of base station (BS) antennas in massive multiple-input multiple-output (MIMO) systems, linear precoding schemes are able to achieve the near-optimal performance, and thus are more attractive than nonlinear precoding techniques. However, conventional linear precoding schemes such as zero-forcing (ZF) precoding involve the matrix inversion of large size with high computational complexity, especially in massive MIMO systems. To reduce the complexity, in this letter, we propose a low-complexity linear precoding scheme based on the symmetric successive over relaxation (SSOR) method. Moreover, we propose a simple way to approximate the optimal relaxation parameter of the SSOR-based precoding by exploiting the channel property of asymptotical orthogonality in massive MIMO systems. We show that the proposed SSOR-based precoding can reduce the complexity of the classical ZF precoding by about one order of magnitude without performance loss, and it also outperforms the recently proposed linear approximate precoding schemes in typical fading channels.
机译:随着大规模多输入多输出(MIMO)系统中基站(BS)天线数量的增加,线性预编码方案能够实现接近最佳的性能,因此比非线性预编码技术更具吸引力。但是,常规的线性预编码方案(例如,迫零(ZF)预编码)涉及具有高计算复杂性的大尺寸矩阵求逆,尤其是在大规模MIMO系统中。为了降低复杂度,在本文中,我们提出了一种基于对称连续过度松弛(SSOR)方法的低复杂度线性预编码方案。此外,我们提出了一种简单的方法,通过利用大规模MIMO系统中渐近正交性的信道特性来近似基于SSOR的预编码的最佳松弛参数。我们表明,提出的基于SSOR的预编码可以将经典ZF预编码的复杂性降低大约一个数量级,而不会降低性能,并且在典型的衰落信道中也优于最近提出的线性近似预编码方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号