Sparse symbol detection by a greedy tree search

Jaeseok Lee, Byonghyo Shim

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

1 Citation (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. We propose a greedy sparse recovery algorithm dubbed as the sparse detection matching pursuit (SDMP) that is effective in recovering the sparse signals with integer constraint. In our performance guarantee analysis and empirical simulations, we show that SDMP is effective in recovering sparse signals in both noiseless and noisy scenarios.

Original languageEnglish
Title of host publicationICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3024-3027
Number of pages4
Volume2015-August
ISBN (Print)9781467369978
DOIs
Publication statusPublished - 2015 Aug 4
Externally publishedYes
Event40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Brisbane, Australia
Duration: 2014 Apr 192014 Apr 24

Other

Other40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015
CountryAustralia
CityBrisbane
Period14/4/1914/4/24

Fingerprint

Recovery

Keywords

  • compressed sensing
  • greedy algorithm
  • Sparse detection
  • tree search
  • underdetermined system

ASJC Scopus subject areas

  • Signal Processing
  • Software
  • Electrical and Electronic Engineering

Cite this

Lee, J., & Shim, B. (2015). Sparse symbol detection by a greedy tree search. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings (Vol. 2015-August, pp. 3024-3027). [7178526] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICASSP.2015.7178526

Sparse symbol detection by a greedy tree search. / Lee, Jaeseok; Shim, Byonghyo.

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. Vol. 2015-August Institute of Electrical and Electronics Engineers Inc., 2015. p. 3024-3027 7178526.

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

Lee, J & Shim, B 2015, Sparse symbol detection by a greedy tree search. in ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. vol. 2015-August, 7178526, Institute of Electrical and Electronics Engineers Inc., pp. 3024-3027, 40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015, Brisbane, Australia, 14/4/19. https://doi.org/10.1109/ICASSP.2015.7178526
Lee J, Shim B. Sparse symbol detection by a greedy tree search. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. Vol. 2015-August. Institute of Electrical and Electronics Engineers Inc. 2015. p. 3024-3027. 7178526 https://doi.org/10.1109/ICASSP.2015.7178526
Lee, Jaeseok ; Shim, Byonghyo. / Sparse symbol detection by a greedy tree search. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. Vol. 2015-August Institute of Electrical and Electronics Engineers Inc., 2015. pp. 3024-3027
@inproceedings{85efcd34b8dd4dd2ad7e9940aa67845d,
title = "Sparse symbol detection by a greedy tree search",
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. We propose a greedy sparse recovery algorithm dubbed as the sparse detection matching pursuit (SDMP) that is effective in recovering the sparse signals with integer constraint. In our performance guarantee analysis and empirical simulations, we show that SDMP is effective in recovering sparse signals in both noiseless and noisy scenarios.",
keywords = "compressed sensing, greedy algorithm, Sparse detection, tree search, underdetermined system",
author = "Jaeseok Lee and Byonghyo Shim",
year = "2015",
month = "8",
day = "4",
doi = "10.1109/ICASSP.2015.7178526",
language = "English",
isbn = "9781467369978",
volume = "2015-August",
pages = "3024--3027",
booktitle = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Sparse symbol detection by a greedy tree search

AU - Lee, Jaeseok

AU - Shim, Byonghyo

PY - 2015/8/4

Y1 - 2015/8/4

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. We propose a greedy sparse recovery algorithm dubbed as the sparse detection matching pursuit (SDMP) that is effective in recovering the sparse signals with integer constraint. In our performance guarantee analysis and empirical simulations, we show that SDMP is effective in recovering sparse signals in both noiseless and noisy scenarios.

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. We propose a greedy sparse recovery algorithm dubbed as the sparse detection matching pursuit (SDMP) that is effective in recovering the sparse signals with integer constraint. In our performance guarantee analysis and empirical simulations, we show that SDMP is effective in recovering sparse signals in both noiseless and noisy scenarios.

KW - compressed sensing

KW - greedy algorithm

KW - Sparse detection

KW - tree search

KW - underdetermined system

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

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

U2 - 10.1109/ICASSP.2015.7178526

DO - 10.1109/ICASSP.2015.7178526

M3 - Conference contribution

SN - 9781467369978

VL - 2015-August

SP - 3024

EP - 3027

BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -