Abstract:

In largescale multiple input multiple output (MIMO), the antenna number in the base station reaches tens or even hundreds, which is much large than the user numbers. Consequently, matchingfiltering (MF) detector can be applied for largescale MIMO uplink multiuser detection (MUD). However, compared to conventional zeroforcing (ZF) and minimum me〖JP+3〗an square error (MMSE) detectors, there is significant performance loss for MF. At the same time, “error floor” phenomenon is observed in the high signalnoise rate regions. In order to resolve these problems of MF referred above, a new MUD algorithm is designed based on matching filtering successive interference cancellation (MFSIC) and local search. Theoretical analyses show that, similar as MF, the computational complexity of the new algorithm is one order lower than that of ZF and MMSE. Simulation results show that the new algorithm outperforms MF on both symbol error rate and bit error rate.