Performance Analysis for Massive MIMO Downlink With Low Complexity Approximate Zero-Forcing Precoding

  title={Performance Analysis for Massive MIMO Downlink With Low Complexity Approximate Zero-Forcing Precoding},
  author={Cheng Zhang and Yindi Jing and Yongming Huang and Luxi Yang},
  journal={IEEE Transactions on Communications},
Zero-forcing (ZF) precoding plays an important role for massive MIMO downlink due to its near optimal performance. However, the high computation cost of the involved matrix inversion hinders its application. In this paper, we adopt the first order Neumann series (NS) for a low-complexity approximation. By introducing a relaxation parameter jointly with the channel non-orthogonality between one selected user and others into the precondition matrix, we propose the identity-plus-column NS (ICNS… 

Figures from this paper

Inverse Extrapolation for Efficient Precoding in Time-Varying Massive MIMO–OFDM Systems

In inverse extrapolation that extrapolates the channel and inverse matrix coefficients separately, the RZF coefficients are obtained with comparably low complexity with no need for matrix inversion, and the proposed scheme is preferable since it can reduce the complexity.

Iterative Matrix Inversion Methods for Precoding in Cell-Free Massive MIMO Systems

This work examines several iterative methods to calculate the precoding matrix in a cell-free mMIMO system and investigates their computational complexity and convergence rate in the presence of small- and large-scale fading and spatial correlation between antennas.

Low-Complexity Computation of Zero-Forcing Equalizers for Massive MIMO-OFDM

  • K. HuA. G. Armada
  • Computer Science
    2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring)
  • 2019
This work proposes the combination of using Neumann series (NS) as a low-complexity approximation to obtain the matrix inversions with the interpolation of the inverted matrix, that, to the best of the knowledge, have never been analyzed in this context.

An Improved Jacobi-Based Detector for Massive MIMO Systems

This work proposes an improved Jacobi iterative algorithm that performs better than the conventional algorithms in terms of the bit error rate (BER) and achieves a near-optimal detection accuracy as the typical MMSE detector, but utilizing a small number of iterations.

A Statistical Linear Precoding Scheme Based On Random Iterative Method For Massive MIMO Systems

The random iterative method is introduced to massive multiple-input multiple-output (MIMO) systems for the efficient downlink linear precoding and 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.

A Low-Complexity QR-based Precoding for Massive MIMO Systems with Channel Update

A modified two-stage precoding based on channel extension to balance the multi-user interference and noise effect is developed and a low-complexity precoding algorithm is proposed with channel update into three cases of position.

Block-Diagonal Zero-Forcing Beamforming for Weighted Sum-Rate Maximization in Multi-User Massive MIMO Systems

It is shown that the BD-ZF beamforming problems can be globally solved using water-filling algorithms and can offer better performance than the state-of-art low complexity beamforming technique ZF but with only an extra little bit computational overhead.

Average SEP-Optimal Precoding for Correlated Massive MIMO With ZF Detection: An Asymptotic Analysis

This paper investigates the symbol error probability (SEP) of point-to-point massive multiple-input multiple-output (MIMO) systems using equally likely PAM, PSK, and square QAM signallings in the presence of transmitter correlation and derives closed-form expressions for the SEP limits of both optimally precoded and uniformly precoded systems.

A Deep Learning-Based Framework for Low Complexity Multi-User MIMO Precoding Design

Simulation results show that the proposed low-complexity precoding scheme achieves similar performance as the WMMSE algorithm with very low computational complexity.

A Low Complexity Massive MIMO Detection Scheme Using Angular-Domain Processing

This work proposes the first angular-domain massive MIMO detection scheme, which is based on three concepts: transferring the baseband processing from the spatial domain to the angular domain; exploiting the sparsity of received beams to reduce the dimension of CSI matrix; and performing the whole detection and precoding in the angulardomain using the reduced CSI matrix.



Low Complexity Approximate Zero-Forcing Precoding for Massive MIMO Downlink

This paper introduces a relaxation parameter jointly with one user's channel interference to others into the precondition matrix and proposes the identity-plus- column NS (ICNS) method, and the closed-form sum-rate approximation of the ICNS method is derived.

A Low-Complexity Linear Precoding Scheme Based on SOR Method for Massive MIMO Systems

The proposed successive overrelaxation (SOR)-based precoding scheme to approximate the matrix inversion by exploiting the asymptotically orthogonal channel property in massive MIMO systems can reduce the complexity by about one order of magnitude, and it can also approach the classical RZF precoding with negligible performance loss.

Low-Complexity SSOR-Based Precoding for Massive MIMO Systems

It is shown 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.

Joint CSIT Acquisition Based on Low-Rank Matrix Completion for FDD Massive MIMO Systems

A joint CSIT acquisition scheme to reduce the overhead by utilizing the low-rank property of the massive MIMO channel matrix, and a hybrid low- rank matrix completion algorithm based on the singular value projection to solve this problem.

Richardson Method Based Linear Precoding with Low Complexity for Massive MIMO Systems

Simulation results show that RM- based precoding can achieve the near-optimal performance of ZF precoding with only a small number of iterations, and it is proved that the optimal relaxation parameter to RM can be approached by a simple and quantified value to maximize the convergence rate of RM-based precoding.

Joint conjugate gradient and Jacobi iteration based low complexity precoding for massive MIMO systems

A novel joint conjugate gradient (CG) and Jacobi (JC) iteration method is proposed to speed up the convergence rate as well as guaranteeing the bit error rate (BER) performance.

On the matrix inversion approximation based on neumann series in massive MIMO systems

The effects of the ratio of thenumber of massive MIMO antennas to the number of users on the performance of NS-based MIA is analyzed and the approximation error estimation formulas for different practical numbers of terms of NS -based MIA are derived.

Low-latency approximate matrix inversion for high-throughput linear pre-coders in massive MIMO

  • Syed Mohsin AbbasC. Tsui
  • Computer Science
    2016 IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)
  • 2016
A novel initial approximation for the Neumann series is presented which facilitates the parallel computation of the inverse and hence results in lower latency for inversion as well as better accuracy when compared to the previous approaches.

Capacity-approaching linear precoding with low-complexity for large-scale MIMO systems

This paper proposes a low-complexity linear precoding scheme based on the Gauss-Seidel (GS) method that can achieve the capacity-approaching performance of the classicallinear precoding schemes in an iterative way without complicated matrix inversion.

Linear precoding based on polynomial expansion: reducing complexity in massive MIMO

This work proposes to replace the matrix inversion and multiplication by a truncated polynomial expansion (TPE), thereby obtaining the new TPE precoding scheme which is more suitable for real-time hardware implementation and significantly reduces the delay to the first transmitted symbol.