English
Related papers

Related papers: Multirate Synchronous Sampling of Sparse Multiband…

200 papers

We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of…

Numerical Analysis · Computer Science 2009-01-08 Wei Dai , Olgica Milenkovic

Periodic nonuniform sampling is a known method to sample spectrally sparse signals below the Nyquist rate. This strategy relies on the implicit assumption that the individual samplers are exposed to the entire frequency range. This…

Information Theory · Computer Science 2009-01-27 Moshe Mishali , Yonina C. Eldar , Joel A. Tropp

Compressed sensing is a theory which guarantees the exact recovery of sparse signals from a small number of linear projections. The sampling schemes suggested by current compressed sensing theories are often of little practical relevance…

Information Theory · Computer Science 2014-07-22 Jérémie Bigot , Claire Boyer , Pierre Weiss

Compressive sensing is a technique to sample signals well below the Nyquist rate using linear measurement operators. In this paper we present an algorithm for signal reconstruction given such a set of measurements. This algorithm…

Information Theory · Computer Science 2009-06-08 Graeme Pope

We study the problem of sampling a random signal with sparse support in frequency domain. Shannon famously considered a scheme that instantaneously samples the signal at equispaced times. He proved that the signal can be reconstructed as…

Information Theory · Computer Science 2012-11-22 Adel Javanmard , Andrea Montanari

In this paper we study the reconstruction of binary sparse signals from partial random circulant measurements. We show that the reconstruction via the least-squares algorithm is as good as the reconstruction via the usually used program…

Information Theory · Computer Science 2020-06-29 Sandra Keiper

Signals sparse in a transformation domain can be recovered from a reduced set of randomly positioned samples by using compressive sensing algorithms. Simple re- construction algorithms are presented in the first part of the paper. The…

Information Theory · Computer Science 2015-12-08 Ljubisa Stankovic , Isidora Stankovic

Signals comprised of a stream of short pulses appear in many applications including bio-imaging and radar. The recent finite rate of innovation framework, has paved the way to low rate sampling of such pulses by noticing that only a small…

Information Theory · Computer Science 2015-05-18 Ronen Tur , Yonina C. Eldar , Zvi Friedman

A novel compressive-sensing based signal multiplexing scheme is proposed in this paper to further improve the multiplexing gain for multiple input multiple output (MIMO) system. At the transmitter side, a Gaussian random measurement matrix…

Information Theory · Computer Science 2016-04-05 Chanzi Liu , Qingchun Chen , Xiaohu Tang

In this paper, we consider recovery of jointly sparse multichannel signals from incomplete measurements. Several approaches have been developed to recover the unknown sparse vectors from the given observations, including thresholding,…

Information Theory · Computer Science 2009-04-06 Yonina C. Eldar , Holger Rauhut

This paper develops new theory and algorithms to recover signals that are approximately sparse in some general dictionary (i.e., a basis, frame, or over-/incomplete matrix) but corrupted by a combination of interference having a sparse…

Information Theory · Computer Science 2013-09-06 Christoph Studer , Richard G. Baraniuk

In this work, we analyze modulated sampling schemes, such as the Nyquist Folding Receiver, which are highly efficient, readily implementable, non-uniform sampling schemes that allows for the blind estimation of a narrow-band signal's…

Information Theory · Computer Science 2012-08-01 Ray Maleh , Gerald L. Fudge

Super-resolution theory aims to estimate the discrete components lying in a continuous space that constitute a sparse signal with optimal precision. This work investigates the potential of recent super-resolution techniques for spectral…

Information Theory · Computer Science 2016-11-24 M. Ferreira Da Costa , W. Dai

In this article, we address the problem of reducing the number of required samples for Spherical Near-Field Antenna Measurements (SNF) by using Compressed Sensing (CS). A condition to ensure the numerical performance of sparse recovery…

Information Theory · Computer Science 2023-02-10 Arya Bangun , Cosme Culotta-López

In this paper, we consider multi-channel sampling (MCS) for graph signals. We generally encounter full-band graph signals beyond the bandlimited one in many applications, such as piecewise constant/smooth and union of bandlimited graph…

Signal Processing · Electrical Eng. & Systems 2023-01-31 Junya Hara , Yuichi Tanaka

The problem of recovering a structured signal from its linear measurements in the presence of speckle noise is studied. This problem appears in many imaging systems such as synthetic aperture radar and optical coherence tomography. The…

Information Theory · Computer Science 2021-08-03 Wenda Zhou , Shirin Jalali , Arian Maleki

We consider scattered data approximation in samplet coordinates with $\ell_1$-regularization. The application of an $\ell_1$-regularization term enforces sparsity of the coefficients with respect to the samplet basis. Samplets are…

Machine Learning · Statistics 2024-04-03 Davide Baroli , Helmut Harbrecht , Michael Multerer

Parallel acquisition systems arise in various applications in order to moderate problems caused by insufficient measurements in single-sensor systems. These systems allow simultaneous data acquisition in multiple sensors, thus alleviating…

Information Theory · Computer Science 2023-08-31 Il Yong Chun , Ben Adcock

Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…

Information Theory · Computer Science 2015-05-18 Dmitry Malioutov , Sujay Sanghavi , Alan Willsky

The sparsity of multipaths in the wideband channel has motivated the use of compressed sensing for channel estimation. In this letter, we propose a different approach to sparse channel estimation. We exploit the fact that $L$ taps of…

Information Theory · Computer Science 2022-01-24 Woong-Hee Lee , Ki Won Sung