Iterative reconstruction algorithms in compressed sensing

Ludovic Danjean, Vida Ravanmehr, David Declercq, Bane V Vasic

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

2 Scopus citations

Abstract

In this paper we give an overview of current results in iterative reconstruction of sparse signals using parity check matrices of low-density parity check (LDPC) codes as measurement matrices in compressed sensing. We provide a detailed explanation of two iterative reconstruction algorithms, Interval Passing (IP) algorithm and verification algorithm. We then compare their performance using parity check matrices of quasi-cyclic low-density parity check (QC-LDPC) codes with different column-weights and rates.

Original languageEnglish (US)
Title of host publication2011 19th Telecommunications Forum, TELFOR 2011 - Proceedings of Papers
Pages537-541
Number of pages5
DOIs
Publication statusPublished - 2011
Event2011 19th Telecommunications Forum, TELFOR 2011 - Belgrade, Serbia
Duration: Nov 22 2011Nov 24 2011

Other

Other2011 19th Telecommunications Forum, TELFOR 2011
CountrySerbia
CityBelgrade
Period11/22/1111/24/11

    Fingerprint

Keywords

  • compressed sensing
  • iterative reconstruction algorithm
  • low-density parity check codes

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Danjean, L., Ravanmehr, V., Declercq, D., & Vasic, B. V. (2011). Iterative reconstruction algorithms in compressed sensing. In 2011 19th Telecommunications Forum, TELFOR 2011 - Proceedings of Papers (pp. 537-541). [6143605] https://doi.org/10.1109/TELFOR.2011.6143605