Iteratively Reweighted two-Stage LASSO for Block-Sparse Signal Recovery Under Finite-Alphabet Constraints - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Signal Processing Année : 2019

Iteratively Reweighted two-Stage LASSO for Block-Sparse Signal Recovery Under Finite-Alphabet Constraints

Résumé

In this paper, we derive an efficient iterative algorithm for the recovery of block-sparse signals given the finite data alphabet and the non-zero block probability. The non-zero block number is supposed to be far smaller than the total block number (block-sparse). The key principle is the separation of the unknown signal vector into an unknown support vector s and an unknown data symbol vector a. Both number (‖s‖0) and positions (s ∈ {0, 1}) of non-zero blocks are unknown. The proposed algorithms use an iterative two-stage LASSO procedure consisting in optimizing the recovery problem alternatively with respect to a and with respect to s. The first algorithm resorts on ℓ1-norm of the support vector and the second one applies reweighted ℓ1-norm, which further improves the recovery performance. Performance of proposed algorithms is illustrated in the context of sporadic multiuser communications. Simulations show that the reweighted-ℓ1 algorithm performs close to its lower bound (perfect knowledge of the support vector).
Fichier principal
Vignette du fichier
letter_singlecolumn_final.pdf (392.26 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01933349 , version 1 (23-11-2018)

Identifiants

Citer

Malek Messai, Abdeldjalil Aissa El Bey, Karine Amis Cavalec, Frédéric Guilloud. Iteratively Reweighted two-Stage LASSO for Block-Sparse Signal Recovery Under Finite-Alphabet Constraints. Signal Processing, 2019, 157, pp.73-77. ⟨10.1016/j.sigpro.2018.11.007⟩. ⟨hal-01933349⟩
119 Consultations
154 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More