Flexible tree-search based orthogonal matching pursuit algorithm

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.