A Novel Fast Linear Iteration Detection Algorithm in MU-Massive MIMO Systems

Massive MIMO is an extremely attractive technology for the potential of improving transmission capacity significantly. However, the minimum mean square error (MMSE) detection algorithm has also high complexity because it involves matrix inversion in obtaining the near-optimal detection for uplink multiuser massive MIMO (MU-Massive MIMO) systems. Iteration detection is effective in avoiding matrix inversion, and several iteration methods have been proposed by academia as well. In this paper, we propose a parallel fast linear iteration detection (FLID) algorithm for uplink MU-Massive MIMO systems. The proposed FLID algorithm can accelerate the convergence rate through reducing the spectral radius ρ(B)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho ({\mathbf {B}})$$\end{document} of the re-derived iteration matrix B, and reach almost the same near-optimal detection as MMSE through a parallel iteration. The computational complexity of FLID reduces from O(K3)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(K^{3})$$\end{document} to O(K2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(K^{2})$$\end{document}. Simulation results show that the proposed FLID algorithm can also achieve the same detection performance to the traditional MMSE algorithm with lower complexity.