Performance Comparison of Reconstruction Algorithms in Discrete Blind Multi-Coset Sampling

Ruben Grigoryan, Thomas Arildsen, Deepaknath Tandur, Torben Larsen

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

3 Citations (Scopus)
440 Downloads (Pure)

Abstract

This paper investigates the performance of different reconstruction algorithms in discrete blind multi-coset sampling. Multi-coset scheme is a promising compressed sensing architecture that can replace traditional Nyquist-rate sampling in the applications with multi-band frequency sparse signals. The performance of the existing compressed sensing reconstruction algorithms have
not been investigated yet for the discrete multi-coset sampling. We compare the following algorithms – orthogonal matching pursuit, multiple signal classification, subspace-augmented multiple signal classification, focal under-determined system solver and basis pursuit denoising. The comparison is performed via numerical simulations for different sampling conditions. According to the simulations, focal under-determined system solver outperforms all other algorithms for signals with low signal-to-noise ratio. In other cases, the multiple signal classification algorithm is more beneficial.
Original languageEnglish
Title of host publicationProceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology
Number of pages6
PublisherIEEE Press
Publication date2012
Pages147-152
ISBN (Print)978-1-4673-5604-6
DOIs
Publication statusPublished - 2012
EventIEEE International Symposium on Signal Processing and Information Technology - Ho Chi Minh City, Viet Nam
Duration: 12 Dec 201215 Dec 2012

Conference

ConferenceIEEE International Symposium on Signal Processing and Information Technology
CountryViet Nam
CityHo Chi Minh City
Period12/12/201215/12/2012

Fingerprint

Sampling
Compressed sensing
Frequency bands
Signal to noise ratio
Computer simulation

Cite this

Grigoryan, R., Arildsen, T., Tandur, D., & Larsen, T. (2012). Performance Comparison of Reconstruction Algorithms in Discrete Blind Multi-Coset Sampling. In Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology (pp. 147-152). IEEE Press. https://doi.org/10.1109/ISSPIT.2012.6621277
Grigoryan, Ruben ; Arildsen, Thomas ; Tandur, Deepaknath ; Larsen, Torben. / Performance Comparison of Reconstruction Algorithms in Discrete Blind Multi-Coset Sampling. Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology. IEEE Press, 2012. pp. 147-152
@inproceedings{cb20775e485b460992e3e8a6dc5c4252,
title = "Performance Comparison of Reconstruction Algorithms in Discrete Blind Multi-Coset Sampling",
abstract = "This paper investigates the performance of different reconstruction algorithms in discrete blind multi-coset sampling. Multi-coset scheme is a promising compressed sensing architecture that can replace traditional Nyquist-rate sampling in the applications with multi-band frequency sparse signals. The performance of the existing compressed sensing reconstruction algorithms havenot been investigated yet for the discrete multi-coset sampling. We compare the following algorithms – orthogonal matching pursuit, multiple signal classification, subspace-augmented multiple signal classification, focal under-determined system solver and basis pursuit denoising. The comparison is performed via numerical simulations for different sampling conditions. According to the simulations, focal under-determined system solver outperforms all other algorithms for signals with low signal-to-noise ratio. In other cases, the multiple signal classification algorithm is more beneficial.",
author = "Ruben Grigoryan and Thomas Arildsen and Deepaknath Tandur and Torben Larsen",
year = "2012",
doi = "10.1109/ISSPIT.2012.6621277",
language = "English",
isbn = "978-1-4673-5604-6",
pages = "147--152",
booktitle = "Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology",
publisher = "IEEE Press",

}

Grigoryan, R, Arildsen, T, Tandur, D & Larsen, T 2012, Performance Comparison of Reconstruction Algorithms in Discrete Blind Multi-Coset Sampling. in Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology. IEEE Press, pp. 147-152, IEEE International Symposium on Signal Processing and Information Technology, Ho Chi Minh City, Viet Nam, 12/12/2012. https://doi.org/10.1109/ISSPIT.2012.6621277

Performance Comparison of Reconstruction Algorithms in Discrete Blind Multi-Coset Sampling. / Grigoryan, Ruben; Arildsen, Thomas; Tandur, Deepaknath; Larsen, Torben.

Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology. IEEE Press, 2012. p. 147-152.

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

TY - GEN

T1 - Performance Comparison of Reconstruction Algorithms in Discrete Blind Multi-Coset Sampling

AU - Grigoryan, Ruben

AU - Arildsen, Thomas

AU - Tandur, Deepaknath

AU - Larsen, Torben

PY - 2012

Y1 - 2012

N2 - This paper investigates the performance of different reconstruction algorithms in discrete blind multi-coset sampling. Multi-coset scheme is a promising compressed sensing architecture that can replace traditional Nyquist-rate sampling in the applications with multi-band frequency sparse signals. The performance of the existing compressed sensing reconstruction algorithms havenot been investigated yet for the discrete multi-coset sampling. We compare the following algorithms – orthogonal matching pursuit, multiple signal classification, subspace-augmented multiple signal classification, focal under-determined system solver and basis pursuit denoising. The comparison is performed via numerical simulations for different sampling conditions. According to the simulations, focal under-determined system solver outperforms all other algorithms for signals with low signal-to-noise ratio. In other cases, the multiple signal classification algorithm is more beneficial.

AB - This paper investigates the performance of different reconstruction algorithms in discrete blind multi-coset sampling. Multi-coset scheme is a promising compressed sensing architecture that can replace traditional Nyquist-rate sampling in the applications with multi-band frequency sparse signals. The performance of the existing compressed sensing reconstruction algorithms havenot been investigated yet for the discrete multi-coset sampling. We compare the following algorithms – orthogonal matching pursuit, multiple signal classification, subspace-augmented multiple signal classification, focal under-determined system solver and basis pursuit denoising. The comparison is performed via numerical simulations for different sampling conditions. According to the simulations, focal under-determined system solver outperforms all other algorithms for signals with low signal-to-noise ratio. In other cases, the multiple signal classification algorithm is more beneficial.

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

U2 - 10.1109/ISSPIT.2012.6621277

DO - 10.1109/ISSPIT.2012.6621277

M3 - Article in proceeding

SN - 978-1-4673-5604-6

SP - 147

EP - 152

BT - Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology

PB - IEEE Press

ER -

Grigoryan R, Arildsen T, Tandur D, Larsen T. Performance Comparison of Reconstruction Algorithms in Discrete Blind Multi-Coset Sampling. In Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology. IEEE Press. 2012. p. 147-152 https://doi.org/10.1109/ISSPIT.2012.6621277