Sparse symbol detection by a greedy tree search

Jaeseok Lee; Byonghyo Shim

doi:10.1109/ICASSP.2015.7178526

Sparse symbol detection by a greedy tree search

Jaeseok Lee, Byonghyo Shim

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	3024-3027
Number of pages	4
Volume	2015-August
ISBN (Print)	9781467369978
DOIs	https://doi.org/10.1109/ICASSP.2015.7178526
Publication status	Published - 2015 Aug 4
Externally published	Yes
Event	40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Brisbane, Australia Duration: 2014 Apr 19 → 2014 Apr 24

Other

Other	40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015
Country/Territory	Australia
City	Brisbane
Period	14/4/19 → 14/4/24

Keywords

compressed sensing
greedy algorithm
Sparse detection
tree search
underdetermined system

ASJC Scopus subject areas

Signal Processing
Software
Electrical and Electronic Engineering

Access to Document

10.1109/ICASSP.2015.7178526

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, 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

@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 = aug,

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.",

note = "40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 ; Conference date: 19-04-2014 Through 24-04-2014",

}

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

AN - SCOPUS:84946060084

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.

T2 - 40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015

Y2 - 19 April 2014 through 24 April 2014

ER -

Sparse symbol detection by a greedy tree search

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this