Abstract

Several approximate matrix inversion methods have been used in linear massive MIMO uplink detectors where their convergence rate, performance, and complexity are greatly affected by the initial solution. In this Letter, the authors exploit a stair matrix, instead of a diagonal matrix, in initialising iterative linear minimum mean square error massive MIMO detector based on several approximate matrix inversion methods, namely, the Gauss-Seidel, successive over relaxation, Richardson iteration, and Newton iteration methods. Numerical results show a significant performance enhancement without a burden of extra complexity using a stair matrix over a diagonal matrix in all methods.