The orthogonal matching pursuit (OMP) algorithm is an adaptive nonlinear algorithm for signal decomposition using an overcomplete dictionary. In [1], a tree-search based orthogonal matching pursuit (TB-OMP) is proposed. 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.

Additional Metadata
Persistent URL dx.doi.org/10.1109/ICASSP.2005.1416098
Conference 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '05
Citation
Karabulut, G.Z. (Güneş Z.), Moura, L. (Lucia), Panario, D, & Yongaçoglu, A. (Abbas). (2005). Flexible tree-search based orthogonal matching pursuit algorithm. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. doi:10.1109/ICASSP.2005.1416098