Iterative Receivers for Large-Scale MIMO Systems With Finite-Alphabet Simplicity-Based Detection

In this paper, we consider large-scale MIMO systems and we define iterative receivers which use the simplicity-based detection algorithm referred to as Finite Alphabet Simplicity (FAS) algorithm. First, we focus on uncoded systems and we propose a novel successive interference cancellation algorithm with an iterative processing based on the shadow area principle and we optimize its parameters by exploiting the theoretical analysis of the detector output. Secondly, we assume FEC-encoded systems and we propose an iterative receiver based on a maximum likelihood-like detection with restricted candidate subset defined by the FAS algorithm output. We also introduce another receiver based on FAS detection whose criterion is penalized with the mean absolute error function. Simulations results show the efficiency of all proposed iterative receivers compared to the state-of-the-art methods.