Low-complexity detection based on landweber method in the uplink of Massive MIMO systems

In this paper, we present low-complexity uplink detection algorithms in Massive MIMO systems. We treat the uplink detection as an ill-posed problem and adopt Landweber Method to solve it. In order to reduce the computational complexity and increase the convergence rate, we optimize the relax factor and propose improved Landweber Method with optimal relax factor (ILM-O) algorithm. We also try to reduce the order of Landweber Method by introducing a set of coefficients and propose reduced order Landweber Method (ROLM) algorithm. A analysis on the convergence and the complexity is provided. Numerical results show that the proposed algorithms outperform the existing algorithm significantly when the system scale is large.