Applications of sparse approximation in communications

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005-January, Issue , 2005, Pages

  Gilbert, A C ^a   Tropp, J A ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; GAUSSIAN NOISE (ELECTRONIC); MIMO SYSTEMS;

ALGORITHMIC SOLUTIONS; CHANNEL PARAMETER; ENGINEERING APPLICATIONS; LINEAR COMBINATIONS; SIMULTANEOUS SPARSE APPROXIMATIONS; SPARSE APPROXIMATIONS; TRANSMITTED SIGNAL; WIRELESS COMMUNICATION CHANNELS;

APPROXIMATION ALGORITHMS;

EID: 85015362807     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523488     Document Type: Conference Paper

References (28)

1. A. J. Miller, Subset selection in regression, Chapman and Hall, London, 2nd edition, 2002.
2. R. A. DeVore, "Nonlinear approximation," Acta Numerica, pp. 51-150, 1998.
3. Vladimir Temlyakov, "Nonlinear methods of approximation," Foundations of Computational Math., 2002.
4. S. Mallat and Z. Zhang, "Matching pursuits with time frequency dictionaries," IEEE Trans. Signal Processing, vol. 41, no. 12, pp. 3397-3415, 1993.
5. G. Davis, S. Mallat, and M. Avellaneda, "Greedy adaptive approximation," Journal of Constructive Approximation, vol. 13, pp. 57-98, 1997.
6. L. F. Villemoes, "Best approximation with walsh atoms," Constr. Approx., vol. 13, pp. 329-355, 1997.
7. Z. Zhang, Matching Pursuit, Ph.D. thesis, New York University, 1993.
8. R. Gribonval E. Bacry, "Harmonic decomposition of audio signals with matching pursuit," IEEE Trans. Signal Processing, pp. 101-111, 2003.
9. P. Frossard P. Vandergheynst R. M. Figueras i Ventura M. Kunt, "A posteriori quantization of progressive matching pursuit streams," IEEE Trans. Signal Processing, pp. 525-535, 2004.
10. T. Nguyen A. Zakhor, "Matching pursuits based multiple description video coding for lossy environments," ICIP 2003, 2003.
11. H. L. Taylor S. C. Banks J. F. McCoy, "Deconvolution with the 1 norm," Geophysics, vol. 1, no. 44, pp. 39-52, 1979.
12. J. Rissanen, "Modeling by shortest data description," Automatica, vol. 14, pp. 465-471, 1979.
13. F. Girosi, "An equivalence between sparse approximation and support vector machines," Neural Comput., pp. 1455-1480, 1998.
14. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comp., vol. 20, no. 1, pp. 33-61, 1999, electronic.
15. Ingrid Daubechies, Michel Defrise, and Christine De Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Communications in Pure and Applied Math, vol. 57, pp. 1413-1457, 2004.
16. A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss, "Approximation of functions over redundant dictionaries using coherence," in The 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2003.
17. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," In preparation.
18. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inform. Theory, vol. 47, pp. 2845-2862, Nov. 2001.
19. D. L. Donoho and M. Elad, "Optimally sparse representation in general (non-orthogonal) dictionaries via 1 minimization," Draft, Dec. 2002.
20. J. A. Tropp, "Just relax: Convex programming methods for subset selection and sparse approximation," ICES Report 04-04, The University of Texas at Austin, 2004.
21. D. Donoho, "For most large underdetermined systems of linear equations, the minimal l1-norm near-solution approximates the sparsest," 2004.
22. D. Donoho, "For most large underdetermined systems of linear equations, the minimal l1-norm solution is the sparsest," 2004.
23. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation part i: Greedy pursuit," submitted, 2004.
24. D. Leviatan and V. N. Temlyakov, "Simultaneous approximation by greedy algorithms," IMI Report 2003:02, Univ. of South Carolina at Columbia, 2003.
25. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Simultaneous approximation by greedy pursuit," in ICASSP 2005, 2005.
26. Xiaoming Huo, "private communication," 2005.
27. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North-Holland, 1977.
28. A. R. Hammons Jr. P. Vijay Kumar A. R. Calderbank N. J. A. Sloane P. Sole, "The z4-linearity of kerdock, preparata, goethals and related codes," IEEE Trans. Inform. Theory, pp. 301-319, 1994.