English
Related papers

Related papers: Identifiability Conditions for Compressive Multich…

200 papers

In this work, we study the problem of reconstructing a sparse signal from a limited number of linear 'incoherent' noisy measurements, when a part of its support is known. The known part of the support may be available from prior knowledge…

Information Theory · Computer Science 2009-10-12 Wei Lu , Namrata Vaswani

In this paper we analyze the blind deconvolution of an image and an unknown blur in a coded imaging system. The measurements consist of subsampled convolution of an unknown blurring kernel with multiple random binary modulations (coded…

Information Theory · Computer Science 2015-10-27 Sohail Bahmani , Justin Romberg

Sparsity in the delay-Doppler (DD) domain enables efficient channel estimation, but the realization-wise sparsity level is rarely known in advance, and it fluctuates. What if we could estimate the channel without ever knowing how many…

Information Theory · Computer Science 2026-05-04 Zijian Yang , Yulin Shao , Fen Hou , Shaodan Ma

We derive fundamental sample complexity bounds for recovering sparse and structured signals for linear and nonlinear observation models including sparse regression, group testing, multivariate regression and problems with missing features.…

Information Theory · Computer Science 2017-02-17 Cem Aksoylar , George Atia , Venkatesh Saligrama

Compressed sensing is a powerful tool in applications such as magnetic resonance imaging (MRI). It enables accurate recovery of images from highly undersampled measurements by exploiting the sparsity of the images or image patches in a…

Machine Learning · Statistics 2016-10-04 Saiprasad Ravishankar , Yoram Bresler

This paper investigates channel estimation for linear time-varying (LTV) wireless channels under double sparsity, i.e., sparsity in both the delay and Doppler domains. An on-grid approximation is first considered, enabling rigorous…

Information Theory · Computer Science 2025-11-10 Wissal Benzine , Ali Bemani , Nassar Ksairi , Dirk Slock

This paper considers the transceiver design for uplink massive multiple-input multiple-output (MIMO) systems with channel sparsity in the angular domain. Recent progress has shown that sparsity-learning-based blind signal detection is able…

Information Theory · Computer Science 2019-06-05 Wenjing Yan , Xiaojun Yuan

Compressed sensing allows for the recovery of sparse signals from few measurements, whose number is proportional to the sparsity of the unknown signal, up to logarithmic factors. The classical theory typically considers either random linear…

Functional Analysis · Mathematics 2025-04-02 Giovanni S. Alberti , Alessandro Felisi , Matteo Santacesaria , S. Ivan Trapasso

We consider the problem of exact support recovery of sparse signals via noisy measurements. The main focus is the sufficient and necessary conditions on the number of measurements for support recovery to be reliable. By drawing an analogy…

Information Theory · Computer Science 2010-03-04 Yuzhe Jin , Young-Han Kim , Bhaskar D. Rao

In this paper, we consider the problem of sparse signal detection based on partial support set estimation with compressive measurements in a distributed network. Multiple nodes in the network are assumed to observe sparse signals which…

Applications · Statistics 2016-08-10 Thakshila Wimalajeewa , Pramod K. Varshney

A new variant of the Compressed Sensing problem is investigated when the number of measurements corrupted by errors is upper bounded by some value l but there are no more restrictions on errors. We prove that in this case it is enough to…

Information Theory · Computer Science 2015-09-25 Grigory Kabatiansky , Cedric Tavernier , Serge Vladuts

This paper considers the problem of estimating the channel response (or Green's function) between multiple source-receiver pairs. Typically, the channel responses are estimated one-at-a-time: a single source sends out a known probe signal,…

Numerical Analysis · Mathematics 2015-05-18 Justin Romberg , Ramesh Neelamani

The ability to resolve detail in the object that is being imaged, named by resolution, is the core parameter of an imaging system. Super-resolution is a class of techniques that can enhance the resolution of an imaging system and even…

Data Structures and Algorithms · Computer Science 2022-10-13 Yaonan Jin , Daogao Liu , Zhao Song

We propose new compressive parameter estimation algorithms that make use of polar interpolation to improve the estimator precision. Our work extends previous approaches involving polar interpolation for compressive parameter estimation in…

Information Theory · Computer Science 2016-11-17 Karsten Fyhn , Marco F. Duarte , Søren Holdt Jensen

Advances of information-theoretic understanding of sparse sampling of continuous uncoded signals at sampling rates exceeding the Landau rate were reported in recent works. This work examines sparse sampling of coded signals at sub-Landau…

Information Theory · Computer Science 2013-03-04 Michael Peleg , Shlomo Shamai

Mid-infrared spectroscopy is often used to identify material. Thousands of spectral points are measured in a time-consuming process using expensive table-top instrument. However, material identification is a sparse problem, which in theory…

Instrumentation and Detectors · Physics 2022-12-27 Yurui Qu , Qingyi Zhou , Jin Xiang , Zongfu Yu

This paper extends the sample complexity theory for ill-posed inverse problems developed in a recent work by the authors [`Compressed sensing for inverse problems and the sample complexity of the sparse Radon transform', J. Eur. Math. Soc.,…

Functional Analysis · Mathematics 2025-01-06 Giovanni S. Alberti , Alessandro Felisi , Matteo Santacesaria , S. Ivan Trapasso

The increasingly crowded spectrum has spurred the design of joint radar-communications systems that share hardware resources and efficiently use the radio frequency spectrum. We study a general spectral coexistence scenario, wherein the…

Information Theory · Computer Science 2023-06-21 Edwin Vargas , Kumar Vijay Mishra , Roman Jacome , Brian M. Sadler , Henry Arguello

We study the problem of estimating the best B term Fourier representation for a given frequency-sparse signal (i.e., vector) $\textbf{A}$ of length $N \gg B$. More explicitly, we investigate how to deterministically identify B of the…

Discrete Mathematics · Computer Science 2007-08-10 M. A. Iwen

We consider the problem of detecting the presence of a spatially correlated multichannel signal corrupted by additive Gaussian noise (i.i.d across sensors). No prior knowledge is assumed about the system parameters such as the noise…

Information Theory · Computer Science 2013-04-19 Vidyadhar Upadhya , Devendra Jalihal