Papers
Topics
Authors
Recent
Search
2000 character limit reached

Iterative Methods for Sparse Signal Reconstruction from Level Crossings

Published 30 Nov 2016 in cs.IT and math.IT | (1611.10136v1)

Abstract: This letter considers the problem of sparse signal reconstruction from the timing of its Level Crossings (LC)s. We formulate the sparse Zero Crossing (ZC) reconstruction problem in terms of a single 1-bit Compressive Sensing (CS) model. We also extend the Smoothed L0 (SL0) sparse reconstruction algorithm to the 1-bit CS framework and propose the Binary SL0 (BSL0) algorithm for iterative reconstruction of the sparse signal from ZCs in cases where the number of sparse coefficients is not known to the reconstruction algorithm a priori. Similar to the ZC case, we propose a system of simultaneously constrained signed-CS problems to reconstruct a sparse signal from its Level Crossings (LC)s and modify both the Binary Iterative Hard Thresholding (BIHT) and BSL0 algorithms to solve this problem. Simulation results demonstrate superior performance of the proposed LC reconstruction techniques in comparison with the literature.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.