The Cramér-Rao Bound for Estimating a Sparse Parameter Vector

DOI10.1109/TSP.2010.2045423MaRDI QIDQ4570335zbMATH OpenFDO

Authors Zvika Ben-Haim, Y. C. Eldar

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2010.2045423

Mathematics Subject Classification ID

Parametric inference under constraints (62F30) Estimation in multivariate analysis (62H12)

Cited in

(7)

• Optimal multilinear estimation of a random vector under constraints of causality and limited memory
• A new sensor selection scheme for Bayesian learning based sparse signal recovery in WSNs
• A Lorentzian IHT for complex-valued sparse signal recovery
• Recovery error analysis of noisy measurement in compressed sensing
• Maximum-Likelihood Estimation, the CramÉr–Rao Bound, and the Method of Scoring With Parameter Constraints
• Compact CramÉr–Rao Bound Expression for Independent Component Analysis
• Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise

This page was built for publication: The Cramér-Rao Bound for Estimating a Sparse Parameter Vector

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570335)