Low Complexity Approximate Zero-Forcing Precoding for Massive MIMO Downlink

Zero-forcing (ZF) precoding plays an important role for massive MIMO downlink due to its near optimal performance in high signal-to- noise (SNR) region. However, the high computation cost of the involved matrix inversion hinders its application in practical large- scale systems. In this paper, we ad...

Full description

Saved in:
Bibliographic Details
Published in:2018 IEEE International Conference on Communications (ICC) pp. 1 - 6
Main Authors: Zhang, Cheng, Jing, Yindi, Huang, Yongming, Yang, Luxi
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2018
Subjects:
Computational complexity
Covariance matrices
Downlink
Interference
MIMO communication
Precoding
ISSN:1938-1883
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Zero-forcing (ZF) precoding plays an important role for massive MIMO downlink due to its near optimal performance in high signal-to- noise (SNR) region. However, the high computation cost of the involved matrix inversion hinders its application in practical large- scale systems. In this paper, we adopt the first order Neumann series (NS) expansion for a low-complexity approximation of matrix inversion. Compared to existing NS based schemes, we introduce a relaxation parameter jointly with one user's channel interference to others into the precondition matrix and propose the identity-plus- column NS (ICNS) method. By further exploiting the multi-user diversity gain via choosing the user with largest interference to others, the ordered ICNS method is also proposed. Moreover, the closed-form sum-rate approximation of the ICNS method is derived. Simulations verify our analytical results and the advantage of the proposed schemes over other existing low-complexity ZF precodings for massive MIMO systems with correlated channels and not-so-small loading factor.
ISSN:1938-1883
DOI:10.1109/ICC.2018.8422133