{"title":"Splitting Matching Pursuit Method for Reconstructing Sparse Signal in Compressed Sensing","authors":"L. Jing, Chong-Zhao Han, Xianghua Yao, Lian Feng","doi":"10.1155/2013/804640","DOIUrl":null,"url":null,"abstract":"In this paper, a novel method named as splitting matching pursuit (SMP) is proposed to reconstruct -sparse \nsignal in compressed sensing. The proposed method selects largest components of the correlation \nvector , which are divided into split sets with equal length . The searching area is thus expanded to incorporate \nmore candidate components, which increases the probability of finding the true components at one iteration. The \nproposed method does not require the sparsity level to be known in prior. The Merging, Estimation and Pruning \nsteps are carried out for each split set independently, which makes it especially suitable for parallel computation. The \nproposed SMP method is then extended to more practical condition, e.g. the direction of arrival (DOA) estimation \nproblem in phased array radar system using compressed sensing. Numerical simulations show that the proposed \nmethod succeeds in identifying multiple targets in a sparse radar scene, outperforming other OMP-type methods. \nThe proposed method also obtains more precise estimation of DOA angle using one snapshot compared with the \ntraditional estimation methods such as Capon, APES (amplitude and phase estimation) and GLRT (generalized \nlikelihood ratio test) based on hundreds of snapshots.","PeriodicalId":49251,"journal":{"name":"Journal of Applied Mathematics","volume":"2013 1","pages":"1-8"},"PeriodicalIF":1.2000,"publicationDate":"2013-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2013/804640","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2013/804640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, a novel method named as splitting matching pursuit (SMP) is proposed to reconstruct -sparse
signal in compressed sensing. The proposed method selects largest components of the correlation
vector , which are divided into split sets with equal length . The searching area is thus expanded to incorporate
more candidate components, which increases the probability of finding the true components at one iteration. The
proposed method does not require the sparsity level to be known in prior. The Merging, Estimation and Pruning
steps are carried out for each split set independently, which makes it especially suitable for parallel computation. The
proposed SMP method is then extended to more practical condition, e.g. the direction of arrival (DOA) estimation
problem in phased array radar system using compressed sensing. Numerical simulations show that the proposed
method succeeds in identifying multiple targets in a sparse radar scene, outperforming other OMP-type methods.
The proposed method also obtains more precise estimation of DOA angle using one snapshot compared with the
traditional estimation methods such as Capon, APES (amplitude and phase estimation) and GLRT (generalized
likelihood ratio test) based on hundreds of snapshots.
期刊介绍:
Journal of Applied Mathematics is a refereed journal devoted to the publication of original research papers and review articles in all areas of applied, computational, and industrial mathematics.