Abstract
For uplink large-scale multiple-input–multiple-output (MIMO) systems, the minimum mean square error (MMSE) algorithm is near optimal but involves matrix inversion with high complexity. In this paper, we propose to exploit the Gauss–Seidel (GS) method to iteratively realize the MMSE algorithm without the complicated matrix inversion. To further accelerate the convergence rate and reduce the complexity, we propose a diagonal-approximate initial solution to the GS method, which is much closer to the final solution than the traditional zero-vector initial solution. We also propose an approximated method to compute log-likelihood ratios for soft channel decoding with a negligible performance loss. The analysis shows that the proposed GS-based algorithm can reduce the computational complexity from ${{\mathcal O}({K^3})}$ to ${{\mathcal O}({K^2})}$ , where ${K}$ is the number of users. Simulation results verify that the proposed algorithm outperforms the recently proposed Neumann series approximation algorithm and achieves the near-optimal performance of the classical MMSE algorithm with a small number of iterations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.