Algebraic optimization of binary spatially coupled measurement matrices for interval passing

Salman Habib, Jörg Kliewer

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

1 Scopus citations

Abstract

We consider binary spatially coupled (SC) low density measurement matrices for low complexity reconstruction of sparse signals via the interval passing algorithm (IPA). The IPA is known to fail due to the presence of harmful sub-structures in the Tanner graph of a binary sparse measurement matrix, so called termatiko sets. In this work we construct array-based (AB) SC sparse measurement matrices via algebraic lifts of graphs, such that the number of termatiko sets in the Tanner graph is minimized. To this end, we show for the column-weight-three case that the most critical termatiko sets can be removed by eliminating all length-12 cycles associated with the Tanner graph, via algebraic lifting. As a consequence, IPA-based reconstruction with SC measurement matrices is able to provide an almost error free reconstruction for significantly denser signal vectors compared to uncoupled AB LDPC measurement matrices.

Original languageEnglish (US)
Title of host publication2018 IEEE Information Theory Workshop, ITW 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538635995
DOIs
StatePublished - Jul 2 2018
Event2018 IEEE Information Theory Workshop, ITW 2018 - Guangzhou, China
Duration: Nov 25 2018Nov 29 2018

Publication series

Name2018 IEEE Information Theory Workshop, ITW 2018

Conference

Conference2018 IEEE Information Theory Workshop, ITW 2018
Country/TerritoryChina
CityGuangzhou
Period11/25/1811/29/18

All Science Journal Classification (ASJC) codes

  • Information Systems

Fingerprint

Dive into the research topics of 'Algebraic optimization of binary spatially coupled measurement matrices for interval passing'. Together they form a unique fingerprint.

Cite this