English
Related papers

Related papers: Above the Nyquist Rate, Modulo Folding Does Not Hu…

200 papers

The paper establishes an analog Whittaker-Shannon-Kotelnikov sampling theorem for unbounded non-decaying band-limited signals. An explicit interpolation formula is obtained for signals sublinear growth with rate of growth less than 1/2. At…

Functional Analysis · Mathematics 2025-04-10 Nikolai Dokuchaev

The problem of 1-bit compressive sampling is addressed in this paper. We introduce an optimization model for reconstruction of sparse signals from 1-bit measurements. The model targets a solution that has the least l0-norm among all signals…

Information Theory · Computer Science 2013-02-07 Lixin Shen , Bruce W. Suter

Reconstructing a band-limited function from its finite sample data is a fundamental task in signal analysis. A Gaussian regularized Shannon sampling series has been proved to be able to achieve exponential convergence for uniform sampling.…

Signal Processing · Electrical Eng. & Systems 2022-10-10 Yunfei Yang , Haizhang Zhang

We study the spectral recovery problem for dynamical sampling on a finite cyclic grid. Given time snapshots obtained from a fixed uniform spatial subsampling of the orbit $x_{\ell}=A^{\ell}f$, we aim to recover the spectrum of the unknown…

Information Theory · Computer Science 2026-04-13 HanQin Cai , Longxiu Huang , Tianming Wang , Juntao You

This paper builds theoretical foundations for the recovery of a newly proposed class of smooth graph signals, approximately bandlimited graph signals, under three sampling strategies: uniform sampling, experimentally designed sampling and…

Information Theory · Computer Science 2017-02-21 Siheng Chen , Rohan Varma , Aarti Singh , Jelena Kovačević

In this paper we introduce a new sampling and reconstruction approach for multi-dimensional analog signals. Building on top of the Unlimited Sensing Framework (USF), we present a new folded sampling operator called the multi-dimensional…

Information Theory · Computer Science 2022-09-15 Dorian Florescu , Ayush Bhandari

We study coded distributed matrix multiplication from an approximate recovery viewpoint. We consider a system of $P$ computation nodes where each node stores $1/m$ of each multiplicand via linear encoding. Our main result shows that the…

Information Theory · Computer Science 2021-05-06 Haewon Jeong , Ateet Devulapalli , Viveck R. Cadambe , Flavio Calmon

This study introduces a short-time Fourier transform-based method for reconstructing signals encoded using modulo analog-to-digital converters with 1-bit folding information. In contrast to existing Fourier-based reconstruction approaches…

Signal Processing · Electrical Eng. & Systems 2026-01-14 Neil Irwin Bernardo

Monte Carlo simulations of neutronic systems are computationally intensive and demand significant memory resources for high-fidelity modeling. Compressed sensing enables accurate reconstruction of signals from significantly fewer samples…

Computational Physics · Physics 2026-02-10 Ethan Lame , Camille Palmer , Todd Palmer , Ilham Variansyah

In this paper, the optimal sampling strategies (uniform or nonuniform) and distortion tradeoffs for Gaussian bandlimited periodic signals with additive white Gaussian noise are studied. Our emphasis is on characterizing the optimal sampling…

Information Theory · Computer Science 2016-11-01 Elaheh Mohammadi , Farokh Marvasti

Compressive Sensing (CS) exploits the surprising fact that the information contained in a sparse signal can be preserved in a small number of compressive, often random linear measurements of that signal. Strong theoretical guarantees have…

Information Theory · Computer Science 2014-05-02 Armin Eftekhari , Michael B. Wakin

With the advent of massive data outputs at a regular rate, admittedly, signal processing technology plays an increasingly key role. Nowadays, signals are not merely restricted to physical sources, they have been extended to digital sources…

Information Theory · Computer Science 2015-07-28 Yi Lu

Unlimited sampling provides an acquisition scheme for high dynamic range signals by folding the signal into the dynamic range of the analog-to-digital converter (ADC) using modulo non-linearity prior to sampling to prevent saturation.…

Numerical Analysis · Mathematics 2025-04-09 Matthias Beckmann , Jürgen Jeschke

For a continuous-time additive white Gaussian noise (AWGN) channel with possible feedback, it has been shown that as sampling gets infinitesimally fine, the mutual information of the associative discrete-time channels converges to that of…

Information Theory · Computer Science 2020-08-26 Guangyue Han , Shlomo Shamai

When a sensor has continuous measurements but sends limited messages over a data network to a supervisor which estimates the state, the available packet rate fixes the achievable quality of state estimation. When such rate limits turn…

Optimization and Control · Mathematics 2011-07-21 Maben Rabi , George V. Moustakides , John S. Baras

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of $\mathds{1}_{\{p\leq0\}}$ to the image plane, where $\mathds{1}$ denotes the indicator function…

Computational Geometry · Computer Science 2016-11-03 Mitra Fatemi , Arash Amini , Martin Vetterli

Sigma-Delta modulation is a popular method for analog-to-digital conversion of bandlimited signals that employs coarse quantization coupled with oversampling. The standard mathematical model for the error analysis of the method measures the…

Information Theory · Computer Science 2010-01-29 Percy Deift , C. Sinan Güntürk , Felix Krahmer

This paper considers the problem of sampling and reconstruction of a continuous-time sparse signal without assuming the knowledge of the sampling instants or the sampling rate. This topic has its roots in the problem of recovering multiple…

Information Theory · Computer Science 2017-01-31 Ayush Bhandari , Aurelien Bourquard , Ramesh Raskar

The paper studies spectral representation as well as predictability and recoverability problems for non-vanishing discrete time signals from $\ell_\infty$, i.e. for bounded discrete time signals, including signals that do not vanish at…

Information Theory · Computer Science 2024-10-17 Nikolai Dokuchaev

Suppose a graph $G$ is stochastically created by uniformly sampling vertices along a line segment and connecting each pair of vertices with a probability that is a known decreasing function of their distance. We ask if it is possible to…

Data Structures and Algorithms · Computer Science 2020-06-09 Yu Chen , Sampath Kannan , Sanjeev Khanna