IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/804640.html
   My bibliography  Save this article

Splitting Matching Pursuit Method for Reconstructing Sparse Signal in Compressed Sensing

Author

Listed:
  • Liu Jing
  • Han ChongZhao
  • Yao XiangHua
  • Lian Feng

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.

Suggested Citation

  • Liu Jing & Han ChongZhao & Yao XiangHua & Lian Feng, 2013. "Splitting Matching Pursuit Method for Reconstructing Sparse Signal in Compressed Sensing," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-8, May.
  • Handle: RePEc:hin:jnljam:804640
    DOI: 10.1155/2013/804640
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2013/804640.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/JAM/2013/804640.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/804640?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnljam:804640. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.