Noise-Resilient Unlimited Sampling and Recovery of Sparse Signals
Geethu Joseph (TU Delft - Electrical Engineering, Mathematics and Computer Science)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
In this paper, we investigate the use of modulo-ADCs in compressed sensing to handle the issue of the limited dynamic range of standard ADCs. The current state-of-the-art algorithm for modulo-compressed sensing uses an ℓ1-norm-based approximation of the sparsity constraint, resulting in a computationally demanding mixed-integer linear optimization. Handling noisy measurements further complicates the problem, requiring mixed-integer quadratic programming, a problem known to be NP-hard. We present an alternative iterative hard-thresholding approach to address this issue. Our solution is computationally simpler and capable of handling noisy measurements. Additionally, we provide theoretical guarantees that the algorithm can successfully recover sparse vectors if the sampling operator satisfies the integer augmented-restricted isometry property, which holds when the number of measurements is sufficiently large.