DocumentCode :
3618249
Title :
Flexible tree-search based orthogonal matching pursuit algorithm
Author :
G.Z. Karabulut;L. Moura;D. Panario;A. Yongacoglu
Author_Institution :
Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont., Canada
Volume :
4
fYear :
2005
fDate :
6/27/1905 12:00:00 AM
Abstract :
The orthogonal matching pursuit (OMP) algorithm is an adaptive nonlinear algorithm for signal decomposition using an overcomplete dictionary. A tree-search based orthogonal matching pursuit (TB-OMP) has been proposed (Cotter et al. (2001)). Although the TB-OMP algorithm improves the approximation performance, its computation time requirement increases exponentially making the algorithm impractical for certain applications. In this paper, we propose the flexible tree-search based orthogonal matching pursuit (FTB-OMP). The algorithm provides design parameters that give flexibility to establish a tradeoff between approximation performance and experimental time complexity. Sparse signal representations are frequently required in problems related to signal processing and communication areas. The proposed FTB-OMP algorithm is a promising solution for such problems.
Keywords :
"Matching pursuit algorithms","Pursuit algorithms","Signal processing algorithms","Approximation algorithms","Dictionaries","Signal representations","Signal resolution","Algorithm design and analysis","Information technology","Mathematics"
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP ´05). IEEE International Conference on
ISSN :
1520-6149
Print_ISBN :
0-7803-8874-7
Type :
conf
DOI :
10.1109/ICASSP.2005.1416098
Filename :
1416098
Link To Document :
بازگشت