On the achievability of Cramér-Rao bound in noisy compressed sensing

IEEE Transactions on Signal Processing

Volumn 60, Issue 1, 2012, Pages 518-526

  Niazadeh, Rad ^a   Babaie Zadeh, Massoud ^b   Jutten, Christian ^c,d  

^a School of Operations Research and Industrial Engineering   (United States)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^c UNIV GRENOBLE ALPES   (France)

^d INSTITUT UNIVERSITAIRE DE FRANCE   (France)

Author keywords

Chernoff bound; compressed sensing; joint typicality; typical estimation

Indexed keywords

ACHIEVABILITY; BUILDING BLOCKES; CHERNOFF BOUNDS; COMPRESSED SENSING; COMPRESSIVE SAMPLING; CONCENTRATION OF MEASURE; GAUSSIANITY; JOINT TYPICALITY; LOWER BOUNDS; MATRIX; MEASUREMENT MATRIX; SIGNAL PROCESS; THEORETIC LIMIT;

ESTIMATION;

SIGNAL RECONSTRUCTION;

EID: 84555218027     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2011.2171953     Document Type: Article

References (28)

1. B. Babadi, N. Kalouptsidis, and V. Tarokh, "Asymptotic achievability of the Cramér-Rao bound for noisy compressive sampling," IEEE Trans. Signal Process., vol. 57, no. 3, pp. 1233-1236, 2009.
2. M. Akçakaya and V. Tarokh, "Shannon theoretic limits on noisy compressive sampling," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 492-504, 2010.
3. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
4. E. Candès, "Compressive sampling," in Proc. Int. Congr. Math., 2006, vol. 3, pp. 1433-1452.
5. Y. Tsaig and D. Donoho, "Extensions of compressed sensing," Signal Process., vol. 86, no. 3, pp. 549-571, 2006.
6. E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, p. 489, 2006.
7. R. Baraniuk, E. Candès, R. Nowak, and M.Vetterli, "Compressive sampling," IEEE Signal Process. Mag., vol. 25, no. 2, pp. 12-13, 2008.
8. R. Niazadeh, M. Babaie-Zadeh, and C. Jutten, "An alternating minimization method for sparse channel estimation," in Proc. 9th Int. Conf. Latent Variable Anal. Signal Seperation (LVA-ICA, Formerly Known as ICA), 2010, pp. 319-327.
9. E. Candès, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol. 59, no. 8, pp. 1207-1223, 2006.
10. J. Tropp and A. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, no. 12, p. 4655, 2007.
11. D. Donoho, "For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution," Commun. Pure Appl. Math., vol. 59, no. 6, pp. 797-829, 2006.
12. S. Chen, D. Donoho, and M. Saunders, "Atomic decomposition by basis pursuit," SIAM Rev., vol. 43, no. 1, pp. 129-159, 2001.
13. T. Blumensath and M. Davies, "Gradient pursuits," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2370-2382, 2008.
14. I. Gorodnitsky and B. Rao, "Sparse signal reconstruction from limited data using FOCUSS: Are-weighted minimum norm algorithm," IEEE Trans. Signal Process., vol. 45, no. 3, pp. 600-616, 1997.
15. D. Needell and J. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol. 26, no. 3, pp. 301-321, 2009.
16. H. Mohimani, M. Babaie-Zadeh, and C. Jutten, "A fast approach for overcomplete sparse decomposition based on smoothed l0 norm," IEEE Trans. Signal Process., vol. 57, no. 1, pp. 289-301, 2009.
17. S. Kay, Fundamentals of Statistical Signal Processing: Estimation Theory, ser. Prentice-Hall Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1993.
18. C. Carbonelli, S. Vedantam, and U. Mitra, "Sparse channel estimation with zero tap detection," IEEE Trans. Wireless Commun., vol. 6, no. 5, pp. 1743-1763, 2007.
19. E. Candès and T. Tao, "The Dantzig selector: Statistical estimation when p is much larger than n," Ann. Statist., vol. 35, no. 6, pp. 2313-2351, 2007.
20. Z. Ben-Haim and Y. Eldar, "The Cramér-Rao bound for estimating a sparse parameter vector," IEEE Trans. Signal Process., vol. 58, no. 6, pp. 3384-3389, 2010.
21. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4036-4048, 2006.
22. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 2006.
23. C. Shannon, "A mathematical theory of communication," ACM SIGMOBILE Mobile Comput. Commun. Rev., vol. 5, no. 1, p. 55, 2001.
24. R. Baraniuk, M. Davenport, R. DeVore, and M.Wakin, "A simple proof of the restricted isometry property for random matrices," Construct. Approx., vol. 28, no. 3, pp. 253-263, 2008.
25. D. Achlioptas, "Database-friendly random projections: Johnson-Lindenstrauss with binary coins," J. Comput. Syst. Sci., vol. 66, no. 4, pp. 671-687, 2003.
26. T. Hagerup and C. Rub, "A guided tour of Chernoff bounds," in Proc. Lett., 1989, vol. 33, pp. 305-308.
27. A. Papoulis, S. Pillai, P. A, and P. SU, Probability, Random Variables, and Stochastic Processes. New York: McGraw-Hill, 1965.
28. J. Haupt, W. Bajwa, G. Raz, and R. Nowak, "Toeplitz compressed sensing matrices with applications to sparse channel estimation," IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5862-5875, 2010.