Compressed Sensing of Analog Signals in Shift-Invariant Spaces

Abstract

A traditional assumption underlying most data converters is that the signal should be sampled at a rate exceeding twice the highest frequency. This statement is based on a worst-case scenario in which the signal occupies the entire available bandwidth. In practice, many signals are sparse so that only part of the bandwidth is used. In this paper, we develop methods for low-rate sampling of continuous-time sparse signals in shift-invariant (SI) spaces, generated by m kernels with period T. We model sparsity by treating the case in which only k out of the m generators are active, however, we do not know which k are chosen. We show how to sample such signals at a rate much lower than m/T, which is the minimal sampling rate without exploiting sparsity. Our approach combines ideas from analog sampling in a subspace with a recently developed block diagram that converts an infinite set of sparse equations to a finite counterpart. Using these two components we formulate our problem within the framework of finite compressed sensing (CS) and then rely on algorithms developed in that context. The distinguishing feature of our results is that in contrast to standard CS, which treats finite-length vectors, we consider sampling of analog signals for which no underlying finite-dimensional model exists. The proposed framework allows to extend much of the recent literature on CS to the analog domain.

to appear in IEEE Trans. on Signal Processing

References in corpus (4)

• Sparsity and Incoherence in Compressive Sampling
• From Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog Signals
• Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
• Beyond Bandlimited Sampling: Nonlinearities, Smoothness and Sparsity

Cited by in corpus (35)

• Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• From Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog Signals
• Structured Compressed Sensing: From Theory to Applications
• Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
• Xampling: Signal Acquisition and Processing in Union of Subspaces
• Innovation Rate Sampling of Pulse Streams with Application to Ultrasound Imaging
• Time Delay Estimation from Low Rate Samples: A Union of Subspaces Approach
• Super-Resolution and Reconstruction of Sparse Sub-Wavelength Images
• Multichannel Sampling of Pulse Streams at the Rate of Innovation
• Identification of Parametric Underspread Linear Systems and Super-Resolution Radar
• Reconciling Compressive Sampling Systems for Spectrally-sparse Continuous-time Signals
• Segmented compressed sampling for analog-to-information conversion: Method and performance analysis
• Sub-Nyquist Sampling: Bridging Theory and Practice
• Uncertainty Relations for Shift-Invariant Analog Signals
• Successive Concave Sparsity Approximation for Compressed Sensing
• Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals
• Matched Filtering from Limited Frequency Samples
• Random Sampling in reproducing kernel subspaces of $L^p({\mathbb{R}}^n)$
• Compressive Link Acquisition in Multiuser Communications
• Sampling and Reconstruction of Sparse Signals in Shift-Invariant Spaces: Generalized Shannon's Theorem Meets Compressive Sensing
• Compressed Sensing for Analog Signals
• The Cramer-Rao Bound for Sparse Estimation
• Rank Awareness in Joint Sparse Recovery
• Signal Recovery in Unions of Subspaces with Applications to Compressive Imaging
• Recovering Signals from Lowpass Data
• Random Sampling in Reproducing Kernel Subspace of Mixed Lebesgue Spaces
• Sharp Sufficient Conditions for Stable Recovery of Block Sparse Signals by Block Orthogonal Matching Pursuit
• Relevant sampling in finitely generated shift-invariant spaces
• Single-Pixel Compressive Imaging in Shift-Invariant Spaces via Exact Wavelet Frames
• Summary Based Structures with Improved Sublinear Recovery for Compressed Sensing
• Identification of Sparse Linear Operators
• Oblique Pursuits for Compressed Sensing
• On the Error Exponent of Approximate Sufficient Statistics for M-ary Hypothesis Testing
• GPS Signal Acquisition via Compressive Multichannel Sampling
• Sampling in a Union of Frame Generated Subspaces