Kernel-based parallel multi-user detector for massive-MIMO

One of the proposed solutions to meet the ever growing demand for data rates in 5G communication systems is to use large number of antennas (100–1000) in a massive multiple input multiple output (MIMO) communication system. Performing multi-user (MU) detection over massive-MIMO systems presents many challenges, prime among them being: large-dimensionality of the received dataset which can increase the computational complexity of traditional algorithms, and susceptibility to device impairments like power amplifier (PA) nonlinearity. Due to these factors, detection of the users’ symbols over uplink-MU massive-MIMO systems in a fast and computationally efficient way is an open problem. In this work, a reproducing kernel Hilbert space (RKHS) based block symbol detector is proposed for uplink-MU massive-MIMO systems that works on decomposed blocks of the observations, and selectively decides the use of an incoming observation, thereby rendering the detector to be computationally tractable, and robust to PA-nonlinearity encountered in uplink-MU massive-MIMO. Simulations have been carried out in this work that demonstrate superior performance of the proposed approach as compared to batch/iterative least squares based algorithms.