Sparse signal recovery via multipath matching pursuit

Suhyuk Kwon, Jian Wang, Byonghyo Shim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we propose a sparse recovery algorithm, termed multiple path matching pursuit (MMP), that improves the recovery performance of sparse signals. By investigating the multiple paths and then choosing the most promising path in the final moment, the MMP algorithm improves the chance of finding the true support and therefore enhances the recovery performance. From the restricted isometry property (RIP) analysis, we show that the MMP algorithm can perfectly reconstruct any K-sparse (K >1) signals, provided that the sensing matrix satisfies RIP with δK+L < √ L/√ K +3√ L. We demonstrate by empirical simulations that the MMP algorithm is very competitive in both noisy and noiseless scenarios.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages854-858
Number of pages5
DOIs
Publication statusPublished - 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 2013 Jul 72013 Jul 12

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/TerritoryTurkey
CityIstanbul
Period13/7/713/7/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Sparse signal recovery via multipath matching pursuit'. Together they form a unique fingerprint.

Cite this