Discrete solutions to underdetermined linear systems via sparse-based transform - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Discrete solutions to underdetermined linear systems via sparse-based transform

Résumé

We consider separation of finite alphabet signals in the instantaneous case with underdetermined known mixing matrix. This problem occurs in communication systems, image processing and operations research amongst others. We consider the noiseless case. However, in contrast to these papers, we do not restrict our attention to binary alphabets, but address the case of alphabets with arbitrary finite sizes. In addition, we do not assume that the signal to reconstruct is necessarily sparse. Our approach then involves a suitable sparse transform so as to introduce sparsity constraints. The resulting problem can then be relaxed into 1-norm optimization. The recovery performance of the approach is established for generic random mixing matrices satisfying appropriate asymptotic properties.
Fichier non déposé

Dates et versions

hal-01202972 , version 1 (22-09-2015)

Identifiants

  • HAL Id : hal-01202972 , version 1

Citer

Dominique Pastor, Abdeldjalil Aissa El Bey. Discrete solutions to underdetermined linear systems via sparse-based transform. SPARS 2015 : Signal Processing with Adaptive Sparse Structured Representations Workshop, Jul 2015, Cambridge, United Kingdom. ⟨hal-01202972⟩
90 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More