Journal on Communications ›› 2013, Vol. 34 ›› Issue (4): 180-186.doi: 10.3969/j.issn.1000-436x.2013.04.022

• Academic communication • Previous Articles     Next Articles

Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error

Wen-biao TIAN1,Zheng FU1,2,Guo-sheng RUI1   

  1. 1 Signal and Information Processing Provincial Key Laboratory of Shandong Province,Naval Aeronautical and Astronautical University,Yantai 264001,China
    2 School of Management Engineering, Henan Institute of Engineering, Zhengzhou 451191,China
  • Online:2013-04-25 Published:2017-07-17
  • Supported by:
    The Special Foundation Program for Taishan Mountain Scholars

Abstract:

Compressed sensing is a novel signal processing theory that it introduces a novel way of acquiring compressible signals,the test times of existing sparsity trial and error algorithms were always large.The novel algorithm,blind sparsity adaptive matching pursuit (BSAMP) was proposed,could recover the original signal fast in the case of unknown sparsity.Firstly,the range of sparsity was determined,and each time half of values in current range were eliminated by trial and error test.Secondly,the number of atoms was twice the sparsity,which was united with the set of signal approximation support (got by last iteration) and then reconstructed the signal by solving least-squares problems.Last but not least,the least-squares approximation was pruned by weakly matching for next iteration.The results of simulation show that the novel algorithm can reconstruct signal faster and get larger recovery probability than other similar algorithms in the same conditions.

Key words: signal processing, compressed sensing, blind sparsity, adaptive reconstruction

No Suggested Reading articles found!