Algebraic optimization of binary spatially coupled measurement matrices for interval passing

Document Type

Conference Proceeding

Publication Date

7-2-2018

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.

Identifier

85062107169 (Scopus)

ISBN

[9781538635995]

Publication Title

2018 IEEE Information Theory Workshop Itw 2018

External Full Text Location

https://doi.org/10.1109/ITW.2018.8613339

Grant

1711056

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS