Sparse detection with integer constraint using multipath matching pursuit

Byonghyo Shim, Suhyuk Kwon, Byungkwen Song

Research output: Contribution to journalArticlepeer-review

20 Citations (Scopus)


In this paper, we consider a detection problem of the underdetermined system when the input vector is sparse and its elements are chosen from a set of finite alphabets. This scenario is popular and embraces many of current and future wireless communication systems. We show that a simple modification of multipath matching pursuit (MMP), recently proposed parallel greedy search algorithm, is effective in recovering the discrete and sparse input signals. We also show that the addition of cross validation (CV) to the MMP algorithm is effective in identifying the sparsity level of input vector.

Original languageEnglish
Article number2354392
Pages (from-to)1851-1854
Number of pages4
JournalIEEE Communications Letters
Issue number10
Publication statusPublished - 2014 Oct 1


  • Compressed sensing
  • Greedy algorithms
  • Multipath Matching Pursuit (MMP)
  • Sparse signal recovery

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Sparse detection with integer constraint using multipath matching pursuit'. Together they form a unique fingerprint.

Cite this