Identification of matrices having a sparse representation

IEEE Transactions on Signal Processing

Volumn 56, Issue 11, 2008, Pages 5376-5388

  Pfander, Götz E ^a   Rauhut, Holger ^b   Tanner, Jared ^c  

^a JACOBS UNIVERSITY BREMEN   (Germany)

^b UNIVERSITY OF VIENNA   (Austria)

^c UNIVERSITY OF UTAH   (United States)

Author keywords

Basis pursuit; Channel measurements and estimation; Random matrices; Time frequency shift matrices

Indexed keywords

CHANNEL ESTIMATION; FREQUENCY SHIFT KEYING;

BASIS PURSUIT; BASIS PURSUITS; CHANNEL MEASUREMENTS AND ESTIMATION; COMMUNICATIONS ENGINEERINGS; EFFICIENT; ESTIMATION AND IDENTIFICATIONS; RANDOM MATRICES; RECONSTRUCTION TECHNIQUES; SPARSE REPRESENTATIONS; SPARSE SIGNALS; TIME-FREQUENCY; TIME-FREQUENCY SHIFT MATRICES;

FREQUENCY ESTIMATION;

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

References (57)

1. P. Georgiev and A. Ralescu, "Clustering on subspaces and sparse representation of signals," Circuits Syst., vol. 2, pp. 1843-1846, 2005.
2. M. Herman and T. Strohmer, "High resolution radar via compressed sensing," submitted for publication.
3. W. Kozek and G. Pfander, "Identification of operators with bandlimited symbols," SIAM J. Math. Anal., vol. 37, no. 3, pp. 867-888, 2006.
4. J. Parsons, D. Demery, and A. Turkmani, "Sounding techniques for wideband mobile radio channels: A review," Proc. Inst. Elect. Eng. vol. 138, no. 5, pt. I, pp. 437-446, 1991.
5. G. Pfander and D. Walnut, "Measurement of time-variant channels," IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 4808-4820, 2006.
6. M. Skolnik, Introduction to Radar Systems. New York: McGraw-Hill, 1980.
7. L. M. Correia, Wireless Flexible Personalized Communications. New York: Wiley, 2001.
8. N. Grip and G. Pfander, "A discrete model for the efficient analysis of time-varying narrowband communication channels," Multidimensional Syst. Signal Process., vol. 19, no. 1, pp. 3-40, 2008.
9. M. Pätzold, Mobile Fading Channels: Modelling, Analysis and Simulation. New York: Wiley, 2001.
10. D. Middleton, "Channel modeling and threshold signal processing in underwater acoustics: An analytical overview," IEEE J. Ocean. Eng. vol. OE-12, no. 1, pp. 4-28, 1987.
11. M. Stojanovic, Underwater Acoustic Communications. New York: Wiley, 1999, vol. 22, pp. 688-698.
12. P. Bello, "Characterization of randomly time-variant linear channels," IEEE Trans. Commun., vol. COM-11, pp. 360-393, 1963.
13. I. Cavdar, "Performance analysis in non-Rayleigh and non-Rician communication channels," Comput. Electr. Eng., vol. 28.
14. M. Cetin and B. Sadler, "Semi-blind sparse channel estimation with constant modulus symbols," in Proc. IEEE ICASSP, Atlanta, GA, 2005, vol. 3, pp. iii/561-iii/564.
15. S. Cotter and B. Rao, "Sparse channel estimation via matching pursuit with applications to equalization," IEEE Trans. Commun., vol. 50, no. 3, pp. 374-377, 2002.
16. D. Han, S.-P. Kim, and J. Principe, "Sparse channel estimation with regularization method using convolution inequality for entropy," in Proc. Int. Joint Conf. Neural Netw. (IJCNN'05), Aug. 2005, vol. 4, pp. 2359-2362.
17. S. Sanyal, S. Kukreja, E. Perreault, and D. Westwick, "Identification of linear time varying systems using basis pursuit," in Proc. 27th Annu. IEEE Eng. Med. Biol. (EMBS) Conf. 2005, Shanghai, China, Sep. 1-4, 2005, pp. 22-25.
18. D. L. Donoho and J. Tanner, "Counting faces of randomly-projected polytopes when the projection radically lowers dimension," J. Amer. Math. Soc., to be published.
19. O. Christensen, An Introduction to Frames and Riesz Bases, ser. Applied and Numerical Harmonic Analysis. Boston, MA: Birkhäuser, 2003.
20. K. Gröchenig, "Foundations of Time-Frequency Analysis," in Applied and Numerical Harmonic Analysis. Boston, MA: Birkhäuser, 2001.
21. J. Lawrence, G. Pfander, and D. Walnut, "Linear independence of Gabor systems in finite dimensional vector spaces," J. Fourier Anal. Appl. vol. 11, no. 6, pp. 715-726, 2005.
22. S. Boyd and L. Vandenberghe, Convey Optimization. Cambridge, U.K.; Cambridge Univ. Press, 2004.
23. D. Donoho and Y. Tsaig, "Fast solution of L1-norm minimization problems when the solution may be sparse,".
24. S. Kim, K. Ksh, M. Lustig, S. Boyd, and D. Gorinevsky, "A method for large-scale L1-regularized least squares problems with applications in signal processing and statistics," J. Sel. Topics Signal Process. to be published.
25. A. Gilbert and J. Tropp, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, pp. 4655-4666, Dec. 2007.
26. S. Kunis and H. Rauhut, "Random sampling of sparse trigonometric polynomials II - Orthogonal matching pursuit versus basis pursuit," Found. Comput. Math., to be published.
27. J. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, 2004.
28. D. Donoho, I. Drori, J.-L. Starck, and Y. Tsaig, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," to be published.
29. M. Akcakaya and V. Tarokh, "Performance bounds on sparse representations using redundant frames," to be published.
30. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, "A simple proof of the restricted isometry property for random matrices," Constr. Approx., to be published.
31. E. Candès and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, 2006.
32. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
33. H. Rauhut, K. Schnass, and P. Vandergheynst, "Compressed sensing and redundant dictionaries," IEEE Trans. Inf. Theory, to be published.
34. D. Donoho and J. Tanner, "Sparse nonnegative solutions of underdetermined linear equations by linear programming," Proc. Nat. Acad. Sci., vol. 102, no. 27, pp. 9446-9451, 2005.
35. D. L. Donoho, "Neighborly polytopes and sparse solutions of underdetermined linear equations," Dept. of Statistics, Stanford Univ., Tech. Rep., 2005.
36. D. Donoho, "High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension," Discrete Comput. Geom. vol. 35, no. 4, pp. 617-652, 2006.
37. D. L. Donoho and J. Tanner, "Neighborliness of randomly projected simplices in high dimensions," Proc. Nat. Acad. Sci., vol. 102, no. 27, pp. 9452-9457, 2005, USA.
38. F. Krahmer, G. Pfander, and P. Rashkov, "Uncertainty in time-frequency representations on finite Abelian groups," Appl. Comput. Harmon. Anal., to be published.
39. F. Krahmer, G. Pfander, and P. Rashkov, "Support size conditions for time-frequency representations on finite Abelian groups," Jacobs Univ. Bremen, Tech. Rep. 13, 2007.
40. W. O. Alltop, "Complex sequences with low periodic correlations," IEEE Trans. Inf. Theory, vol. IT-26, no. 3, pp. 350-354, 1980.
41. T. Strohmer and R. W. Heath, "Grassmannian frames with applications to coding and communication," Appl. Comput. Harmon. Anal., vol. 14, no. 3, pp. 257-275, 2003.
42. D. L. Donono, M. Elad, and V. N. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 6-18, 2006.
43. R. Gribonval and P. Vandergheynst, "On the exponential convergence of matching pursuits in quasi-incoherent dictionaries," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 255-261, 2006.
44. J. A. Tropp, "Just relax: Convex programming methods for identifying sparse signals," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 1030-1051, 2006.
45. J. A. Tropp, "On the conditioning of random subdictionaries," Appl. Comput. Harmon. Anal., to be published.
46. 1 minimization," Proc. Nat. Acad. Sci., vol. 100, pp. 2197-2202, 2002.
47. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, 2003.
48. 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.
49. 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, pp. 489-509, 2006.
50. H. Rauhut, "Random sampling of sparse, trigonometric polynomials," Appl. Comput. Harm. Anal., vol. 22, no. 1, pp. 16-42, 2007.
51. H. Rauhut, "Stability results for random sampling of sparse trigonometric polynomials," IEEE Trans. Inf. Theory, to be published.
52. M. Rudelson and R. Vershynin, "Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements," in Proc. 40th Annu. Conf. Inf. Sci. Syst. (CISS 2006), Mar. 2006, pp. 207-212.
53. 1-constrained quadratic programming Univ. of California, Berkeley, 2006.
54. M. Ledoux and M. Talagrand, Probability in Banach Spaces. Isoperimetry and Processes. Berlin, Germany: Springer-Verlag, 1991.
55. G. Pevskir and A. Shiryaev, "The Khintchine inequalities and martingale expanding sphere of their action," Russ. Math. Surv., vol. 50, no. 5, pp. 849-904, 1995.
56. D. Achlioptas, "Database-friendly random projections," in Proc. 20th Annu. ACM SIGACT-SIGMOD-SIGART Symp. Principles Database Syst., 2001, pp. 274-281.
57. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning. Berlin, Germany: Springer, 2001.