Skip to Main content Skip to Navigation
Journal articles

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

Zahran Hajji 1, 2 Karine Amis 2, 1 Abdeldjalil Aissa El Bey 1, 2
1 Lab-STICC_IMTA_CACS_COM
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal-imt-atlantique.archives-ouvertes.fr/hal-02467566
Contributor : Abdeldjalil Aïssa-El-Bey <>
Submitted on : Wednesday, February 5, 2020 - 9:48:39 AM
Last modification on : Wednesday, August 5, 2020 - 3:49:44 AM

Links full text

Identifiers

Citation

Zahran Hajji, Karine Amis, Abdeldjalil Aissa El Bey. Iterative Receivers for Large-Scale MIMO Systems With Finite-Alphabet Simplicity-Based Detection. IEEE Access, IEEE, 2020, 8 (1), pp.21742-21758. ⟨10.1109/ACCESS.2020.2969710⟩. ⟨hal-02467566⟩

Share

Metrics

Record views

567