Abstract
The initial solution of a massive multiple-input multiple-output (M-MIMO) detector for uplink (UL) is greatly influence the balance between the bit error rate (BER) performance and the computational complexity. Although the maximum likelihood (ML) detector obtains the best BER performance, it has an extremely high computational complexity. Iterative linear minimum mean square error (MMSE) detector based on the Gauss–Seidel (GS), the successive over-relaxation (SOR), and the Jacobi (JA), obtains a good performance-complexity profile when the base station (BS)-to-user-antenna-ratio (BUAR) is large. However, when the BUAR is small, the system suffers from a considerable performance loss. In this paper, a hybrid detector based on the joint GS and SOR methods is proposed where the initial solution is determined by the first iteration of GS method. Numerical results show a considerable complexity reduction and performance enhancement using the proposed GS-SOR method over all methods when the BUAR is small.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Wireless Information Networks
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.
