Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Cramer-Rao Bound for a Sparse Complex Model

Abstract : 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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Emilie Chouzenoux Connect in order to contact the contributor
Submitted on : Wednesday, May 7, 2014 - 6:34:25 PM
Last modification on : Saturday, January 15, 2022 - 3:58:32 AM
Long-term archiving on: : Thursday, August 7, 2014 - 12:05:32 PM


Files produced by the author(s)


  • HAL Id : hal-00988369, version 1


Anisia Florescu, Emilie Chouzenoux, Jean-Christophe Pesquet, Silviu Ciochina. Cramer-Rao Bound for a Sparse Complex Model. 2014. ⟨hal-00988369⟩



Record views


Files downloads