Graph-based iterative reconstruction of sparse signals for compressed sensing

Anantha Raman Krishnan, Swaminathan Sankararaman, Bane Vasic

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

5 Scopus citations

Abstract

In this paper, we consider the problem of reconstruction of sparse signals in compressed sensing. In particular, we introduce a novel iterative algorithm based on graph-based decoding of low-density parity-check codes which possesses desirable properties like good performance, low complexity and running time, and ease of implementation. In this work, we outline the reconstruction algorithm, and analyze its performance on some measurement matrices. Furthermore, we also provide some initial results on the theoretical performance limits of this algorithm.

Original languageEnglish (US)
Title of host publication2011 10th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services, TELSIKS 2011 - Proceedings of Papers
Pages133-137
Number of pages5
DOIs
StatePublished - 2011
Event2011 10th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services, TELSIKS 2011 - Nis, Serbia
Duration: Oct 5 2011Oct 8 2011

Publication series

Name2011 10th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services, TELSIKS 2011 - Proceedings of Papers

Other

Other2011 10th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services, TELSIKS 2011
Country/TerritorySerbia
CityNis
Period10/5/1110/8/11

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Fingerprint

Dive into the research topics of 'Graph-based iterative reconstruction of sparse signals for compressed sensing'. Together they form a unique fingerprint.

Cite this