Deterministic and iterative solutions to subset selection problems

IEEE Transactions on Signal Processing

Volumn 50, Issue 7, 2002, Pages 1591-1601

  Nafie, Mohammed ^b   Tewfik, Ahmed H ^a,b   Ali, Murtaza ^b,c  

^a IEEE   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

^c TEXAS INSTRUMENTS   (United States)

Author keywords

Best bases; Iterative solutions; Overcomplete dictionaries; Sparse systems; Subset selection

Indexed keywords

BEST BASES; OVERCOMPLETE DICTIONARIES; SPARSE SYSTEMS; SUBSET SELECTION PROBLEMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GLOBAL OPTIMIZATION; ITERATIVE METHODS; LINEAR PROGRAMMING; MATRIX ALGEBRA;

SIGNAL PROCESSING;

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

References (20)

1. Signal processing with the sparseness constraint
2. A method of self-recovering equalization for multilevel amplitude-modulation systems
3. Reduced complexity M-ary hypotheses testing in wireless communications
4. Atomic decomposition by basis pursuit
5. Time-frequency localization operators: A geometric phase space approach
6. Matching pursuits with time-frequency dictionaries
7. Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm
8. Optimal subset selection for adaptive signal representation
9. Entropy-based algorithms for best basis selection
10. Fast optimal and suboptimal algorithms for sparse solutions to linear inverse problems
11. Sparse approximate solutions to linear systems
12. Measures and algorithms for best basis selection
13. Sparse solutions to linear inverse problems with multiple measurement vectors
14. A new approach to blind identification and equalization of multipath channels
15. Fast blind equalization via antenna arrays
16. Subspace methods for the blind identification of multichannel FIR filters