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 O(K3) to O(K2), 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.
No takes yet. Share an insight, caveat, or question.
Dai et al. (2014) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: