Sparse detection with integer constraint using multipath matching pursuit

Byonghyo Shim, Suhyuk Kwon, Byungkwen Song

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

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
Volume18
Issue number10
DOIs
Publication statusPublished - 2014 Oct 1
Externally publishedYes

Fingerprint

Matching Pursuit
Multipath
Integer
Greedy Algorithm
Sparsity
Wireless Communication
Cross-validation
Search Algorithm
Communication Systems
Communication systems
Scenarios

ASJC Scopus subject areas

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

Cite this

Sparse detection with integer constraint using multipath matching pursuit. / Shim, Byonghyo; Kwon, Suhyuk; Song, Byungkwen.

In: IEEE Communications Letters, Vol. 18, No. 10, 2354392, 01.10.2014, p. 1851-1854.

Research output: Contribution to journalArticle

Shim, Byonghyo ; Kwon, Suhyuk ; Song, Byungkwen. / Sparse detection with integer constraint using multipath matching pursuit. In: IEEE Communications Letters. 2014 ; Vol. 18, No. 10. pp. 1851-1854.
@article{4d248c2275a040c6b12698837ff224e8,
title = "Sparse detection with integer constraint using multipath matching pursuit",
abstract = "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.",
keywords = "Compressed sensing, Greedy algorithms, Multipath Matching Pursuit (MMP), Sparse signal recovery",
author = "Byonghyo Shim and Suhyuk Kwon and Byungkwen Song",
year = "2014",
month = "10",
day = "1",
doi = "10.1109/LCOMM.2014.2354392",
language = "English",
volume = "18",
pages = "1851--1854",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Sparse detection with integer constraint using multipath matching pursuit

AU - Shim, Byonghyo

AU - Kwon, Suhyuk

AU - Song, Byungkwen

PY - 2014/10/1

Y1 - 2014/10/1

N2 - 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.

AB - 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.

KW - Compressed sensing

KW - Greedy algorithms

KW - Multipath Matching Pursuit (MMP)

KW - Sparse signal recovery

UR - http://www.scopus.com/inward/record.url?scp=84908004536&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908004536&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2014.2354392

DO - 10.1109/LCOMM.2014.2354392

M3 - Article

AN - SCOPUS:84908004536

VL - 18

SP - 1851

EP - 1854

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 10

M1 - 2354392

ER -