4.7 Article

A Statistical Linear Precoding Scheme Based on Random Iterative Method for Massive MIMO Systems

Journal

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
Volume 21, Issue 12, Pages 10115-10129

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2022.3182407

Keywords

Massive MIMO; large-scale MIMO; linear pre-coding; low complexity; iterative methods; matrix inversion; convergence analysis and enhancement

Funding

  1. National Natural Science Foundation of China [61801216, 61771124, 61720106003]
  2. Natural Science Foundation of Jiangsu Province [BK20180420, BK20190337]
  3. State Key Laboratory of Integrated Services Networks (Xidian University) [ISN21-31]
  4. Zhi Shan Young Scholar Program of Southeast University
  5. Fundamental Research Funds for the Central Universities [2242022k30002]

Ask authors/readers for more resources

This paper introduces the random iterative method to massive MIMO systems for efficient downlink linear precoding. By incorporating random sampling into traditional iterative methods, the matrix inversion in linear precoding schemes can be statistically approximated, resulting in faster convergence with low complexity and global convergence without convergence requirements. The paper proposes the randomized iterative precoding algorithm (RIPA) and shows that its approximation error decays exponentially and globally with the number of iterations. Furthermore, the concept of conditional sampling is introduced to optimize and enhance the convergence and efficiency of the randomized iterations. The modified randomized iterative precoding algorithm (MRIPA) is then presented based on the equivalent iteration transformation, achieving better precoding performance with low complexity for various scenarios of massive MIMO. Simulation results demonstrate the system gains of RIPA and MRIPA in terms of performance and complexity in downlink precoding for massive MIMO systems.
In this paper, the random iterative method is introduced to massive multiple-input multiple-output (MIMO) systems for the efficient downlink linear precoding. By adopting the random sampling into the traditional iterative methods, the matrix inversion within the linear precoding schemes can be approximated statistically, which not only achieves a faster exponential convergence with low complexity but also experiences a global convergence without suffering from the various convergence requirements. Specifically, based on the random iterative method, the randomized iterative precoding algorithm (RIPA) is firstly proposed and we show its approximation error decays exponentially and globally along with the number of iterations. Then, with respect to the derived convergence rate, the concept of conditional sampling is introduced, so that further optimization and enhancement are carried out to improve both the convergence and the efficiency of the randomized iterations. After that, based on the equivalent iteration transformation, the modified randomized iterative precoding algorithm (MRIPA) is presented, which achieves a better precoding performance with low-complexity for various scenarios of massive MIMO. Finally, simulation results based on downlink precoding in massive MIMO systems are given to show the system gains of RIPA and MRIPA in terms of performance and complexity.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available