Cramer-Rao Bound for a Sparse Complex Model - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2014

Cramer-Rao Bound for a Sparse Complex Model

Résumé

Complex-valued data play a prominent role in a number of signal and image processing applications. The aim of this paper is to establish some theoretical results concerning the Cramer-Rao bound for estimating a spars complex-valued vector. Instead of considering a countable dictionary of vectors, we address the more challenging case of an uncountable set of vectors parameterized by a real variable. We also present a proximal forward-backward algorithm to minimize an l0 penalized cost, which allows us to approach the derived bounds. These results are illustrated on a spectrum analysis problem in the case of irregularly sampled observations.
Fichier principal
Vignette du fichier
PaperHAL.pdf (98.67 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00988369 , version 1 (07-05-2014)

Identifiants

  • HAL Id : hal-00988369 , version 1

Citer

Anisia Florescu, Emilie Chouzenoux, Jean-Christophe Pesquet, Silviu Ciochina. Cramer-Rao Bound for a Sparse Complex Model. 2014. ⟨hal-00988369⟩
192 Consultations
382 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More