首页> 外文期刊>Eurasip Journal on Wireless Communications and Networking >Fast matrix inversion methods based on Chebyshev and Newton iterations for zero forcing precoding in massive MIMO systems
【24h】

Fast matrix inversion methods based on Chebyshev and Newton iterations for zero forcing precoding in massive MIMO systems

机译:基于Chebyshev和Newton迭代的快速矩阵反转方法为大规模MIMO系统中的零强制预编码

获取原文
           

摘要

In massive MIMO (mMIMO) systems, large matrix inversion is a challenging problem due to the huge volume of users and antennas. Neumann series (NS) and successive over relaxation (SOR) are two typical methods that solve such a problem in linear precoding. NS expands the inverse of a matrix into a series of matrix vector multiplications, while SOR deals with the same problem as a system of linear equations and iteratively solves it. However, the required complexities for both methods are still high. In this paper, four new joint methods are presented to achieve faster convergence and lower complexity in matrix inversion to determine linear precoding weights for mMIMO systems, where both Chebyshev iteration (ChebI) and Newton iteration (NI) are investigated separately to speed up the convergence of NS and SOR. Firstly, joint Chebyshev and NS method (ChebI-NS) is proposed not only to accelerate the convergence in NS but also to achieve more accurate inversion. Secondly, new SOR-based approximate matrix inversion (SOR-AMI) is proposed to achieve a direct simplified matrix inversion with similar convergence characteristics to the conventional SOR. Finally, two improved SOR-AMI methods, NI-SOR-AMI and ChebI-SOR-AMI, are investigated for further convergence acceleration, where NI and ChebI approaches are combined with the SOR-AMI, respectively. These four proposed inversion methods provide near optimal bit error rate (BER) performance of zero forcing (ZF) case under uncorrelated and correlated mMIMO channel conditions. Simulation results verify that the proposed ChebI-NS has the highest convergence rate compared to the conventional NS with similar complexity. Similarly, ChebI-SOR-AMI and NI-SOR-AMI achieve faster convergence than the conventional SOR method. The order of the proposed methods according to the convergence speed are ChebI-SOR-AMI, NI-SOR-AMI, SOR-AMI, then ChebI-NS, respectively. ChebI-NS has a low convergence because NS has lower convergence than SOR. Although ChebI-SOR-AMI has the fastest convergence rate, NI-SOR-AMI is preferable than ChebI-SOR-AMI due to its lower complexity and close inversion result.
机译:在大规模的MIMO(MMIMO)系统中,由于大量的用户和天线,大矩阵反转是一个具有挑战性的问题。 Neumann系列(NS)和逐次放松(SOR)是两种典型的方法,解决了线性预编码的这种问题。 NS将矩阵的倒数扩展为一系列矩阵矢量乘法,而SOR处理与线性方程系统相同的问题,并迭代地解决它。然而,两种方法所需的复杂性仍然很高。在本文中,提出了四种新的联合方法,以实现矩阵反转的更快的收敛性和更低的复杂性,以确定MMIMO系统的线性预编码权重,其中Chebyshev迭代(Chebi)和牛顿迭代(NI)分别调查以加速收敛ns和sor。首先,提出了Chebyshev和NS方法(Chebi-NS),不仅可以加速NS的收敛,还可以实现更准确的反演。其次,提出了新的基于SOR的近似矩阵反转(SOR-AMI)以实现具有与常规SOR类似的收敛特性的直接简化的矩阵反转。最后,研究了两种改进的SOR-AMI方法,Ni-Sor-Ami和Chebi-Sor-AMI,以进一步收敛加速,其中Ni和Chebi方法分别与Sor-Ami合并。这四种拟议的反转方法在不相关和相关的MMIMO信道条件下提供零强迫(ZF)案例的最佳误码率(BER)性能。仿真结果验证,与具有相似复杂性的传统NS相比,所提出的Chebi-ns具有最高的收敛速度。类似地,Chebi-Sor-AMI和Ni-Sor-AMI达到比常规SOR方法更快的收敛。根据收敛速度的提出方法的顺序是Chebi-Sor-AMI,Ni-Sor-Ami,Sor-Ami,然后是Chebi-ns。 Chebi-ns的收敛低,因为NS的收敛性低于SOR。虽然Chebi-Sor-AMI具有最快的收敛速率,但由于其较低的复杂性和近倒置结果,Ni-Sor-AMI优选于Chebi-Sor-AMI。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号