Sequential Interval Passing for Compressed Sensing

TL;DR

This paper introduces a sequential interval passing algorithm for compressed sensing that reduces computational complexity significantly while maintaining reconstruction accuracy, inspired by LDPC decoding techniques.

Contribution

It proposes a novel sequential scheduling method for the interval passing algorithm, lowering complexity without sacrificing accuracy in sparse signal reconstruction.

Findings

Sequential IPA reduces complexity by up to 36%.

Reconstruction accuracy remains unaffected by sequential scheduling.

Analytical and numerical validation confirms effectiveness.

Abstract

The reconstruction of sparse signals from a limited set of measurements poses a significant challenge as it necessitates a solution to an underdetermined system of linear equations. Compressed sensing (CS) deals with sparse signal reconstruction using techniques such as linear programming (LP) and iterative message passing schemes. The interval passing algorithm (IPA) is an attractive CS approach due to its low complexity when compared to LP. In this paper, we propose a sequential IPA that is inspired by sequential belief propagation decoding of low-density-parity-check (LDPC) codes used for forward error correction in channel coding. In the sequential setting, each check node (CN) in the Tanner graph of an LDPC measurement matrix is scheduled one at a time in every iteration, as opposed to the standard ``flooding'' interval passing approach in which all CNs are scheduled at once per iteration. The sequential scheme offers a significantly lower message passing complexity compared to flooding IPA on average, and for some measurement matrix and signal sparsity, a complexity reduction of 36% is achieved. We show both analytically and numerically that the reconstruction accuracy of the IPA is not compromised by adopting our sequential scheduling approach.