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

Author:

Hashima Sherief,Muta Osamu

Abstract

AbstractIn 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.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Computer Science Applications,Signal Processing

Cited by 14 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. I/O-efficient iterative matrix inversion with photonic integrated circuits;Nature Communications;2024-07-15

2. An Efficient Mapping Scheme on Neural Networks for Linear Massive MIMO Detection;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2023-11-01

3. Efficient Massive MIMO Detection for M-QAM Symbols;Entropy;2023-02-21

4. Iterative photonic processor for fast complex-valued matrix inversion;Photonics Research;2022-10-17

5. Fast-Converging and Low-Complexity Linear Massive MIMO Detection With L-BFGS Method;IEEE Transactions on Vehicular Technology;2022-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3