English
Related papers

Related papers: Can compressed sensing beat the Nyquist sampling r…

200 papers

Spectrum sensing is a fundamental component in cognitive radio. A major challenge in this area is the requirement of a high sampling rate in the sensing of a wideband signal. In this paper a wideband spectrum sensing model is presented that…

Information Theory · Computer Science 2010-10-12 Moslem Rashidi , Kasra Haghighi , Arash Owrang , Mats Viberg

We demonstrate through numerical simulations with real data the feasibility of using compressive sensing techniques for the acquisition of spectro-polarimetric data. This allows us to combine the measurement and the compression process into…

Instrumentation and Methods for Astrophysics · Physics 2015-05-14 A. Asensio Ramos , A. Lopez Ariste

As a paradigm to recover the sparse signal from a small set of linear measurements, compressed sensing (CS) has stimulated a great deal of interest in recent years. In order to apply the CS techniques to wireless communication systems,…

Information Theory · Computer Science 2016-12-21 Jun Won Choi , Byonghyo Shim , Yacong Ding , Bhaskar Rao , Dong In Kim

Compressive Sensing theory says that it is possible to reconstruct a measured signal if an enough sparse representation of this signal exists in comparison to the number of random measurements. This theory was applied to reconstruct signals…

Compressive sensing is a methodology for the reconstruction of sparse or compressible signals using far fewer samples than required by the Nyquist criterion. However, many of the results in compressive sensing concern random sampling…

Information Theory · Computer Science 2013-06-11 Atul Divekar , Deanna Needell

We improve existing results in the field of compressed sensing and matrix completion when sampled data may be grossly corrupted. We introduce three new theorems. 1) In compressed sensing, we show that if the m \times n sensing matrix has…

Information Theory · Computer Science 2012-01-19 Xiaodong Li

The discrete curvelet transform decomposes an image into a set of fundamental components that are distinguished by direction and size as well as a low-frequency representation. The curvelet representation is approximately sparse; thus, it…

Image and Video Processing · Electrical Eng. & Systems 2022-12-08 Nicholas Dwork , Peder E. Z. Larson

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

Compressive sensing is a signal processing technique that enables the reconstruction of sparse signals from a limited number of measurements, leveraging the signal's inherent sparsity to facilitate efficient recovery. Recent works on the…

Quantum Physics · Physics 2025-01-22 Naveed Naimipour , Collin Frink , Harry Shaw , Haleh Safavi , Mojtaba Soltanalian

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

This paper considers the problem of compressive sensing over a finite alphabet, where the finite alphabet may be inherent to the nature of the data or a result of quantization. There are multiple examples of finite alphabet based static as…

Information Theory · Computer Science 2013-03-19 Abhik Kumar Das , Sriram Vishwanath

In many practical settings one can sequentially and adaptively guide the collection of future data, based on information extracted from data collected previously. These sequential data collection procedures are known by different names,…

Statistics Theory · Mathematics 2013-11-28 Ervin Tánczos , Rui M. Castro

A signature result in compressed sensing is that Gaussian random sampling achieves stable and robust recovery of sparse vectors under optimal conditions on the number of measurements. However, in the context of image reconstruction, it has…

Information Theory · Computer Science 2021-01-26 Ben Adcock , Simone Brugiapaglia , Matthew King-Roskamp

Modern compression algorithms exploit complex structures that are present in signals to describe them very efficiently. On the other hand, the field of compressed sensing is built upon the observation that "structured" signals can be…

Information Theory · Computer Science 2016-01-08 Farideh Ebrahim Rezagah , Shirin Jalali , Elza Erkip , H. Vincent Poor

We explore two fundamental questions at the intersection of sampling theory and information theory: how channel capacity is affected by sampling below the channel's Nyquist rate, and what sub-Nyquist sampling strategy should be employed to…

Information Theory · Computer Science 2015-03-19 Yuxin Chen , Yonina C. Eldar , Andrea J. Goldsmith

How many measurements are fundamentally required to capture a signal. Shannon's information theory established the bedrock of this question in 1948, the Nyquist Shannon theorem set the first answer, and compressed sensing (CS) rewrote it in…

Sampling theory encompasses all aspects related to the conversion of continuous-time signals to discrete streams of numbers. The famous Shannon-Nyquist theorem has become a landmark in the development of digital signal processing. In modern…

Information Theory · Computer Science 2015-03-19 Moshe Mishali , Yonina C. Eldar

Compressive sensing is a sensing protocol that facilitates reconstruction of large signals from relatively few measurements by exploiting known structures of signals of interest, typically manifested as signal sparsity. Compressive…

Quantum Physics · Physics 2022-08-10 Kyle Sherbert , Naveed Naimipour , Haleh Safavi , Harry Shaw , Mojtaba Soltanalian

We characterize the measurement complexity of compressed sensing of signals drawn from a known prior distribution, even when the support of the prior is the entire space (rather than, say, sparse vectors). We show for Gaussian measurements…

Machine Learning · Computer Science 2021-06-23 Ajil Jalal , Sushrut Karmalkar , Alexandros G. Dimakis , Eric Price

The goal of compressed sensing is to learn a structured signal $x$ from a limited number of noisy linear measurements $y \approx Ax$. In traditional compressed sensing, "structure" is represented by sparsity in some known basis. Inspired by…

Data Structures and Algorithms · Computer Science 2019-12-09 Akshay Kamath , Sushrut Karmalkar , Eric Price