English
Related papers

Related papers: Almost Lossless Analog Signal Separation

200 papers

We propose an information-theoretic framework for analog signal separation. Specifically, we consider the problem of recovering two analog signals, modeled as general random vectors, from the noiseless sum of linear measurements of the…

Information Theory · Computer Science 2017-07-14 David Stotz , Erwin Riegler , Eirikur Agustsson , Helmut Bölcskei

We propose an information-theoretic framework for phase retrieval. Specifically, we consider the problem of recovering an unknown n-dimensional vector x up to an overall sign factor from m=Rn phaseless measurements with compression rate R…

Information Theory · Computer Science 2015-04-23 Erwin Riegler , Georg Tauböck

Wu and Verd\'u developed a theory of almost lossless analog compression, where one imposes various regularity conditions on the compressor and the decompressor with the input signal being modelled by a (typically infinite-entropy)…

Dynamical Systems · Mathematics 2022-12-29 Yonatan Gutman , Adam Śpiewak

We establish the fundamental limits of lossless analog compression by considering the recovery of arbitrary m-dimensional real random vectors x from the noiseless linear measurements y=Ax with n x m measurement matrix A. Our theory is…

Functional Analysis · Mathematics 2024-10-03 Giovanni Alberti , Helmut Bölcskei , Camillo De Lellis , Günther Koliander , Erwin Riegler

We establish the fundamental limits of lossless linear analog compression by considering the recovery of random vectors ${\boldsymbol{\mathsf{x}}}\in{\mathbb R}^m$ from the noiseless linear measurements…

Information Theory · Computer Science 2016-05-06 Giovanni Alberti , Helmut Bölcskei , Camillo De Lellis , Günther Koliander , Erwin Riegler

Wu and Verd\'u developed a theory of almost lossless analog compression, where one imposes various regularity conditions on the compressor and the decompressor with the input signal being modelled by a (typically infinite-entropy)…

Dynamical Systems · Mathematics 2022-12-29 Yonatan Gutman , Adam Śpiewak

We consider the problem of recovering fusion frame sparse signals from incomplete measurements. These signals are composed of a small number of nonzero blocks taken from a family of subspaces. First, we show that, by using a-priori…

Information Theory · Computer Science 2014-07-30 Ulaş Ayaz , Sjoerd Dirksen , Holger Rauhut

Conventional sparse phase retrieval schemes can recover sparse signals from the magnitude of linear measurements only up to a global phase ambiguity. This work proposes a novel approach that instead utilizes the magnitude of affine…

Information Theory · Computer Science 2021-05-25 Ming-Hsun Yang , Y. -W. Peter Hong , Jwo-Yuh Wu

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

In this paper we develop a general theory of compressed sensing for analog signals, in close similarity to prior results for vectors in finite dimensional spaces that are sparse in a given orthonormal basis. The signals are modeled by…

Functional Analysis · Mathematics 2018-03-13 Bernard G. Bodmann , Axel Flinth , Gitta Kutyniok

Consider the problem of reconstructing a multidimensional signal from an underdetermined set of measurements, as in the setting of compressed sensing. Without any additional assumptions, this problem is ill-posed. However, for signals such…

Numerical Analysis · Mathematics 2015-06-11 Deanna Needell , Rachel Ward

It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…

Methodology · Statistics 2007-11-13 Emmanuel J. Candes , Michael B. Wakin , Stephen P. Boyd

Phase retrieval arises in various fields of science and engineering and it is well studied in a finite-dimensional setting. In this paper, we consider an infinite-dimensional phase retrieval problem to reconstruct real-valued signals living…

Information Theory · Computer Science 2016-03-07 Yang Chen , Cheng Cheng , Qiyu Sun , Haichao Wang

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

We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and…

Information Theory · Computer Science 2015-03-19 David L. Donoho , Adel Javanmard , Andrea Montanari

Representing a continuous-time signal by a set of samples is a classical problem in signal processing. We study this problem under the additional constraint that the samples are quantized or compressed in a lossy manner under a limited…

Information Theory · Computer Science 2018-04-12 Alon Kipnis , Yonina C. Eldar , Andrea J. Goldsmith

We address the problem of reconstructing a multi-band signal from its sub-Nyquist point-wise samples. To date, all reconstruction methods proposed for this class of signals assumed knowledge of the band locations. In this paper, we develop…

Cellular Automata and Lattice Gases · Physics 2007-09-12 Moshe Mishali , Yonina C. Eldar

We formulate a unified framework for the separation of signals that are sparse in "morphologically" different redundant dictionaries. This formulation incorporates the so-called "analysis" and "synthesis" approaches as special cases and…

Information Theory · Computer Science 2016-11-17 Céline Aubel , Christoph Studer , Graeme Pope , Helmut Bölcskei

This letter investigates the joint recovery of a frequency-sparse signal ensemble sharing a common frequency-sparse component from the collection of their compressed measurements. Unlike conventional arts in compressed sensing, the…

Information Theory · Computer Science 2015-06-22 Zhenqi Lu , Rendong Ying , Sumxin Jiang , Peilin Liu , Wenxian Yu

We propose two novel approaches to the recovery of an (approximately) sparse signal from noisy linear measurements in the case that the signal is a priori known to be non-negative and obey given linear equality constraints, such as simplex…

Information Theory · Computer Science 2015-06-17 Jeremy Vila , Philip Schniter
‹ Prev 1 2 3 10 Next ›