Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals

DOI10.1109/TIT.2009.2034811zbMath1366.94222DBLPjournals/tit/TroppLDRB10arXiv0902.0026OpenAlexW2141116650WikidataQ59750714 ScholiaQ59750714MaRDI QIDQ4976068

Richard G. Baraniuk, Justin Romberg, Jason N. Laska, Joel A. Tropp, Marco F. Duarte

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20) Modulation and demodulation in information and communication theory (94A14)

Related Items (36)

Exact penalization for cardinality and rank-constrained optimization problems via partial regularization ⋮ Book Review: A mathematical introduction to compressive sensing ⋮ Compressed sensing and dynamic mode decomposition ⋮ A Survey of Compressed Sensing ⋮ Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication ⋮ The Noise Collector for sparse recovery in high dimensions ⋮ Influence factors of sparse microwave imaging radar system performance: approaches to waveform design and platform motion analysis ⋮ Sparse microwave imaging: principles and applications ⋮ On the uniqueness of the sparse signals reconstruction based on the missing samples variation analysis ⋮ Random Sampling and Reconstruction of Sparse Time- and Band-Limited Signals ⋮ A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing ⋮ Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP ⋮ Uniqueness theorems for tomographic phase retrieval with few coded diffraction patterns ⋮ Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion ⋮ Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries ⋮ Restricted isometries for partial random circulant matrices ⋮ From compression to compressed sensing ⋮ Matrix completion for matrices with low-rank displacement ⋮ Democracy in action: quantization, saturation, and compressive sensing ⋮ Compressive sensing of analog signals using discrete prolate spheroidal sequences ⋮ Short-Term Memory Capacity in Networks via the Restricted Isometry Property ⋮ Statistical mechanics analysis of thresholding 1-bit compressed sensing ⋮ A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates ⋮ CHAOTIC ANALOG-TO-INFORMATION CONVERSION: PRINCIPLE AND RECONSTRUCTABILITY WITH PARAMETER IDENTIFIABILITY ⋮ Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion ⋮ A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials ⋮ Robust sparse signal reconstructions against basis mismatch and their applications ⋮ Mathematics of Analog‐to‐Digital Conversion ⋮ Spectral compressive sensing ⋮ Robust dequantized compressive sensing ⋮ Spectral Compressed Sensing via Projected Gradient Descent ⋮ Sub-Nyquist sampling and reconstruction model of LFM signals based on blind compressed sensing in FRFT domain ⋮ Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction ⋮ Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms ⋮ Sparse reconstruction with multiple Walsh matrices ⋮ New analysis of manifold embeddings and signal recovery from compressive measurements

This page was built for publication: Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals