English
Related papers

Related papers: Sub-Nyquist Sampling of Sparse and Correlated Sign…

200 papers

Compressed sensing deals with the recovery of sparse signals from linear measurements. Without any additional information, it is possible to recover an $s$-sparse signal using $m \gtrsim s \log(d/s)$ measurements in a robust and stable way.…

Functional Analysis · Mathematics 2016-05-25 Axel Flinth

In this paper, we present an approach to the reconstruction of signals exhibiting sparsity in a transformation domain, having some heavily disturbed samples. This sparsity-driven signal recovery exploits a carefully suited random sampling…

Information Theory · Computer Science 2020-03-30 Ljubisa Stankovic , Milos Brajovic , Isidora Stankovic , Jonatan Lerga , Milos Dakovic

Compressed sensing is a technique for recovering an unknown sparse signal from a small number of linear measurements. When the measurement matrix is random, the number of measurements required for perfect recovery exhibits a phase…

Optimization and Control · Mathematics 2016-12-30 Mateo Díaz , Mauricio Junca , Felipe Rincón , Mauricio Velasco

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

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

We demonstrate that a sparse signal can be estimated from the phase of complex random measurements, in a "phase-only compressive sensing" (PO-CS) scenario. With high probability and up to a global unknown amplitude, we can perfectly recover…

Information Theory · Computer Science 2020-11-13 Laurent Jacques , Thomas Feuillen

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

Sparse signal reconstruction algorithms have attracted research attention due to their wide applications in various fields. In this paper, we present a simple Bayesian approach that utilizes the sparsity constraint and a priori statistical…

Statistics Theory · Mathematics 2015-06-05 Ahmed A. Quadeer , Tareq Y. Al-Naffouri

We survey a new paradigm in signal processing known as "compressive sensing". Contrary to old practices of data acquisition and reconstruction based on the Shannon-Nyquist sampling principle, the new theory shows that it is possible to…

History and Overview · Mathematics 2009-03-13 Olga Holtz

This paper considers the problem of reconstructing sparse or compressible signals from one-bit quantized measurements. We study a new method that uses a log-sum penalty function, also referred to as the Gaussian entropy, for sparse signal…

Information Theory · Computer Science 2012-10-17 Jun Fang , Yanning Shen , Hongbin Li

This paper studies sequential methods for recovery of sparse signals in high dimensions. When compared to fixed sample size procedures, in the sparse setting, sequential methods can result in a large reduction in the number of samples…

Information Theory · Computer Science 2014-10-07 Matthew L. Malloy , Robert Nowak

Wideband spectrum sensing (WSS) is an essential technology for cognitive radio. However, the sampling rate is still a bottleneck of WSS. Several sub-Nyquist sensing methods have been proposed. These technologies deteriorate in the low…

Signal Processing · Electrical Eng. & Systems 2018-02-13 Kai Cao , Peizhong Lu , Yan Zou , Lin Ling

It is well known that $\ell_1$ minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio between the system dimensions,…

Information Theory · Computer Science 2011-11-08 M. Amin Khajehnejad , Weiyu Xu , A. Salman Avestimehr , Babak Hassibi

We consider the problem of reconstructing a compactly supported function from samples of its Fourier transform taken along a spiral. We determine the Nyquist sampling rate in terms of the density of the spiral and show that below this rate…

Classical Analysis and ODEs · Mathematics 2022-05-04 Philippe Jaming , Felipe Negreira , José Luis Romero

In this paper, we consider the sparse phase retrieval problem, recovering an $s$-sparse signal $\bm{x}^{\natural}\in\mathbb{R}^n$ from $m$ phaseless samples $y_i=|\langle\bm{x}^{\natural},\bm{a}_i\rangle|$ for $i=1,\ldots,m$. Existing…

Numerical Analysis · Mathematics 2021-10-15 Jian-Feng Cai , Jingzhi Li , Xiliang Lu , Juntao You

Phase modulation is a commonly used modulation mode in digital communication, which usually brings phase sparsity to digital signals. It is naturally to connect the sparsity with the newly emerged theory of compressed sensing (CS), which…

Information Theory · Computer Science 2015-01-05 Zhengli Xing , Jie Zhou , Jiangfeng Ye , Jun Yan , Lin Zou , Qun Wan

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

In this letter, we propose a sparsity promoting feedback acquisition and reconstruction scheme for sensing, encoding and subsequent reconstruction of spectrally sparse signals. In the proposed scheme, the spectral components are estimated…

Information Theory · Computer Science 2017-11-28 Mahdi Boloursaz Mashhadi , Saeed Gazor , Nazanin Rahnavard , Farokh Marvasti

A new algorithm is proposed for a) unsupervised learning of sparse representations from subsampled measurements and b) estimating the parameters required for linearly reconstructing signals from the sparse codes. We verify that the new…

Neurons and Cognition · Quantitative Biology 2010-11-02 Guy Isely , Christopher J. Hillar , Friedrich T. Sommer

We develop sub-Nyquist sampling systems for analog signals comprised of several, possibly overlapping, finite duration pulses with unknown shapes and time positions. Efficient sampling schemes when either the pulse shape or the locations of…

Information Theory · Computer Science 2015-03-17 Ewa Matusiak , Yonina C. Eldar