Simplicity-based recovery of finite-alphabet signals for large-scale MIMO systems

In this paper, we consider the problem of finite-alphabet source separation in both determined and underdetermined large-scale systems. First, we address the noiseless case and we propose a linear criterion based on l(1) -minimization combined with box constraints. We investigate also the system conditions that ensure successful recovery. Next, we apply the approach to the noisy massive MIMO transmission and we propose a quadratic criterion-based detector. Simulation results show the efficiency of the proposed detection methods for various QAM modulations and MIMO configurations. We mention that there is no change in the computational complexity when the constellation size increases. Moreover, the proposed method outperforms the classical Minimum Mean Square Error (MMSE)-based detection algorithms. (C) 2018 Elsevier Inc. All rights reserved.