The Cramer-Rao Bound for Sparse Estimation

Details The Cramer-Rao Bound for Sparse Estimation The Cramer-Rao Bound for Sparse Estimation

2009-05-27

arxiv.org/abs/0905.4378v4

Mathematics

Statistics Theory

11 pages, 2 figures. Submitted to IEEE Transactions on Signal Processing

Scientific paper

The goal of this paper is to characterize the best achievable performance for the problem of estimating an unknown parameter having a sparse representation. Specifically, we consider the setting in which a sparsely representable deterministic parameter vector is to be estimated from measurements corrupted by Gaussian noise, and derive a lower bound on the mean-squared error (MSE) achievable in this setting. To this end, an appropriate definition of bias in the sparse setting is developed, and the constrained Cramer-Rao bound (CRB) is obtained. This bound is shown to equal the CRB of an estimator with knowledge of the support set, for almost all feasible parameter values. Consequently, in the unbiased case, our bound is identical to the MSE of the oracle estimator. Combined with the fact that the CRB is achieved at high signal-to-noise ratios by the maximum likelihood technique, our result provides a new interpretation for the common practice of using the oracle estimator as a gold standard against which practical approaches are compared.

Affiliated with

Also associated with

No associations

Rating

The Cramer-Rao Bound for Sparse Estimation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Cramer-Rao Bound for Sparse Estimation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Cramer-Rao Bound for Sparse Estimation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527489