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

Zahran Hajji 1, 2 Abdeldjalil Aïssa-El-Bey 1, 2 Karine Amis Cavalec 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 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 ℓ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.
Type de document :
Article dans une revue
Digital Signal Processing, Elsevier, 2018, 〈10.1016/j.dsp.2018.05.012〉
Liste complète des métadonnées

Littérature citée [29 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01811519
Contributeur : Bibliothèque Télécom Bretagne <>
Soumis le : samedi 9 juin 2018 - 11:08:05
Dernière modification le : jeudi 26 juillet 2018 - 13:30:02

Fichier

simplicity-based-recovery.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Zahran Hajji, Abdeldjalil Aïssa-El-Bey, Karine Amis Cavalec. Simplicity-based recovery of finite-alphabet signals for large-scale MIMO systems. Digital Signal Processing, Elsevier, 2018, 〈10.1016/j.dsp.2018.05.012〉. 〈hal-01811519〉

Partager

Métriques

Consultations de la notice

103

Téléchargements de fichiers

43