Current position: Home >> Scientific Research >> Paper Publications

A Near-Optimal Iterative Linear Precoding With Low Complexity for Massive MIMO Systems

Release Time:2019-07-01  Hits:

Indexed by: Journal Article

Date of Publication: 2019-06-01

Journal: IEEE COMMUNICATIONS LETTERS

Included Journals: EI、SCIE

Volume: 23

Issue: 6

Page Number: 1105-1108

ISSN: 1089-7798

Key Words: Massive MIMO; precoding; low complexity; iteration method

Abstract: The linear zero-forcing (ZF) precoding can achieve the near-optimal sum-rate performance when the favorable channel propagation is obtained in downlink massive multiple-input multiple-output (MIMO) systems. However, it involves high complexity with the matrix inversion. To significantly reduce the complexity of ZF precoding, we propose a weighted two-stage (WTS) precoding scheme with low complexity based on an iterative method. Specifically, the proposed WTS precoding converts the complicated matrix inversion into two-half iteration stages, and the result of each stage is weighted by a coefficient to further speed up the convergence and reduce the complexity. A theoretical analysis demonstrates that the proposed WTS precoding enjoys a fast convergence rate and low complexity. Simulation results indicate that the proposed WTS precoding can achieve better bit error rate (BER) and sum-rate performance with a smaller number of iterations than the recently proposed schemes.

Prev One:Privacy Protection via Beamforming Optimization in MISO NOMA Networks

Next One:Unsupervised Clustering for Nonlinear Equalization in Indoor Millimeter-Wave Communications