Low-complexity SSOR-based precoding for massive MIMO systems

View Researcher II's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Authors Tian Xie, Linglong Dai, Xinyu Gao, Xiaoming Dai, Youping Zhao
Journal/Conference Name IEEE Communications Letters
Paper Category
Paper Abstract With the increase of the number of base station (BS) antennas in massive multiple-input multiple-output (MIMO) systems, linear precoding schemes are able to achieve the near-optimal performance, and thus are more attractive than nonlinear precoding techniques. However, conventional linear precoding schemes such as zero-forcing (ZF) precoding involve the matrix inversion of large size with high computational complexity, especially in massive MIMO systems. To reduce the complexity, in this letter, we propose a low-complexity linear precoding scheme based on the symmetric successive over relaxation (SSOR) method. Moreover, we propose a simple way to approximate the optimal relaxation parameter of the SSOR-based precoding by exploiting the channel property of asymptotical orthogonality in massive MIMO systems. We show 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.
Date of publication 2016
Code Programming Language MATLAB

Copyright Researcher II 2022