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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.