Compressed Sensing of Analog Signals in Shift-Invariant Spaces

DOI10.1109/TSP.2009.2020750zbMATH Open1391.94599arXiv0806.3332OpenAlexW2096504426MaRDI QIDQ4569795FDOQ4569795

Authors: Y. C. Eldar 

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0806.3332

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Cited In (17)

• Convolution random sampling in multiply generated shift-invariant spaces of \(L^p(\mathbb{R}^d)\)
• Sampling and reconstruction of concentrated reproducing kernel signals in mixed Lebesgue spaces
• Random sampling in reproducing kernel subspaces of \(L^p(\mathbb{R}^n)\)
• Generalized sampling and infinite-dimensional compressed sensing
• Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
• Relevant sampling in a reproducing kernel subspace of Orlicz space
• Spherical random sampling of localized functions on 𝕊ⁿ⁻¹
• Random sampling and reconstruction in reproducing kernel subspace of mixed Lebesgue spaces
• Random sampling and reconstruction in multiply generated shift-invariant spaces
• Random Sampling of Mellin Band-Limited Signals
• Title not available (Why is that?)
• Random average sampling in a reproducing kernel subspace of mixed Lebesgue space \(L^{p,q}(\mathbb{R}^{n+1})\)
• Compressed Signal Processing on Nyquist-Sampled Signals
• Curvelet-wavelet regularized split Bregman iteration for compressed sensing
• Random sampling in multiply generated shift-invariant subspaces of mixed Lebesgue spaces \(L^{p,q}(\mathbb{R}\times\mathbb{R}^d)\)
• Random sampling in shift invariant spaces
• Relevant sampling in finitely generated shift-invariant spaces

This page was built for publication: Compressed Sensing of Analog Signals in Shift-Invariant Spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569795)