A fast two-stage algorithm for realizing matching pursuit
Matching pursuit has proved to be one of the most efficient techniques in various signal coding techniques. However, its computation effort is so tremendous that it may not be affordable in some real-time applications. A two-stage filtering structure for realizing matching pursuit has recently proposed. This paper presents an efficient algorithm for the implementation of the structure. The issues of how to determine the elementary dictionary and approximate a given initial dictionary are also addressed. Simulation results show that the proposed algorithm can achieve a significant improvement in the complexity-distortion performance.