Low Complexity Iterative Detection for Uplink Multiuser Large Scale MIMO

In massive Multiple Input Multiple Output (MIMO) or large scale MIMO systems, uplink detection at the Base Station (BS) is a challenging problem due to significant increase of the dimensions in comparison to ordinary MIMO systems. In this letter, a novel iterative method is proposed for detection of the transmitted symbols in uplink multiuser massive MIMO systems. Linear detection algorithms such as minimum-mean-square-error (MMSE) and zero-forcing (ZF), are able to achieve the performance of the near optimal detector, when the number of base station (BS) antennas is enough high. But the complexity of linear detectors in Massive MIMO systems is high due to the necessity of the calculation of the inverse of a large dimension matrix. In this paper, we address the problem of reducing the complexity of the MMSE detector for massive MIMO systems. The proposed method is based on Gram Schmidt algorithm, which improves the convergence speed and also provides better error rate than the alternative methods. It will be shown that the complexity order is reduced from ۰(nt a) to ۰(nt ۲), where nt is the number of users. The proposed method avoids the direct computation of matrix inversion. Simulation results show that the proposed method improves the convergence speed and also it achieves the performance of MMSE detector with considerable lower computational complexity.

کلیدواژه ها:

Massive MIMO ، Iterative Method ، Matrix Inversion ، Maximum Likelihood ، MMSE Detection