Adaptive resolution by matching pursuit algorithms

The family of matching pursuit algorithms are greedy heuristic methods for basis selection problem. In this paper, we propose an adaptive structure for matching pursuit algorithms that uses a progressive refinement structure. The proposed adaptive algorithm allows the detector to adjust the tradeoff between the computational complexity and the resolution performance. The novel algorithm is applied to direction of arrival detection problem and it is shown that the algorithm results in a lower computational complexity than the direct implementation of matching pursuit algorithms.