Sampling and Reconstruction of Sparse Signals in Shift-Invariant Spaces: Generalized Shannon's Theorem Meets Compressive Sensing
arXiv:2010.15618 · doi:10.1109/TSP.2022.3141009
Abstract
This paper introduces a novel framework and corresponding methods for sampling and reconstruction of sparse signals in shift-invariant (SI) spaces. We reinterpret the random demodulator, a system that acquires sparse bandlimited signals, as a system for the acquisition of linear combinations of the samples in the SI setting with the box function as the sampling kernel. The sparsity assumption is exploited by the compressive sensing (CS) paradigm for a recovery of the SI samples from a reduced set of measurements. The SI samples are subsequently filtered by a discrete-time correction filter to reconstruct expansion coefficients of the observed signal. Furthermore, we offer a generalization of the proposed framework to other compactly supported sampling kernels that span a wider class of SI spaces. The generalized method embeds the correction filter in the CS optimization problem which directly reconstructs expansion coefficients of the signal. Both approaches recast an inherently continuous-domain inverse problem in a set of finite-dimensional CS problems in an exact way. Finally, we conduct numerical experiments on signals in polynomial B-spline spaces whose expansion coefficients are assumed to be sparse in a certain transform domain. The coefficients can be regarded as parametric models of an underlying continuous-time signal, obtained from a reduced set of measurements. Such continuous signal representations are particularly suitable for signal processing without converting them into samples.
arXiv comment14 pages, 8 figures
References in corpus (13)
- From Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog Signals
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- Xampling: Signal Acquisition and Processing in Union of Subspaces
- Compressed Sensing of Analog Signals in Shift-Invariant Spaces
- The Sliding Frank-Wolfe Algorithm and its Application to Super-Resolution Microscopy
- On asymptotic structure in compressed sensing
- Splines are Universal Solutions of Linear Inverse Problems with Generalized-TV regularization
- Continuous-Domain Solutions of Linear Inverse Problems with Tikhonov vs. Generalized TV Regularization
- Sparse Stochastic Processes and Discretization of Linear Inverse Problems
- CPGD: Cadzow Plug-and-Play Gradient Descent for Generalised FRI
- Greed is Super: A Fast Algorithm for Super-Resolution
- TV-based Reconstruction of Periodic Functions