...
首页> 外文期刊>IEEE Transactions on Signal Processing: A publication of the IEEE Signal Processing Society >Asymptotic Achievability of the Cramer-Rao Bound for Noisy Compressive Sampling
【24h】

Asymptotic Achievability of the Cramer-Rao Bound for Noisy Compressive Sampling

机译:Asymptotic Achievability of the Cramer-Rao Bound for Noisy Compressive Sampling

获取原文
获取原文并翻译 | 示例

摘要

We consider a model of the form y velence Ax + n, where x E C~(M) is sparse with at most L nonzero coefficients in unknown locations, y E C~(N) is the observation vector, A E C~(N X M) is the measurement matrix and n E C~(N) is the Gaussian noise. We develop a Cramer-Rao bound on the mean squared estimation error of the nonzero elements of x, corresponding to the genie-aided estimator (GAE) which is provided with the locations of the nonzero elements of x. Intuitively, the mean squared estimation error of any estimator without the knowledge of the locations of the nonzero elements of x is no less than that of the GAE. Assuming that L/N is fixed, we establish the existence of an estimator that asymptotically achieves the Cramer-Rao bound without any knowledge of the locations of the nonzero elements of x as N -> infinity, for A a random Gaussian matrix whose elements are drawn i.i.d. according to N(0, 1).

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号