English
Related papers

Related papers: Exponential Approximation of Bandlimited Random Pr…

200 papers

Weighted average sampling is more practical and numerically more stable than sampling at single points as in the classical Shannon sampling framework. Using the frame theory, one can completely reconstruct a bandlimited function from its…

Information Theory · Computer Science 2014-07-04 Haizhang Zhang

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 consider the reconstruction of a bandlimited function from its finite localized sample data. Truncating the classical Shannon sampling series results in an unsatisfactory convergence rate due to the slow decay of the sinc function. To…

Numerical Analysis · Mathematics 2018-11-07 Rongrong Lin

We consider the problem of reconstructing a wide sense stationary band-limited process from its local averages taken either at the Nyquist rate or above. As a result, we obtain a sufficient condition under which average sampling expansions…

Information Theory · Computer Science 2012-11-29 Gilles Faÿ , Sinuk Kang

Instead of sampling a function at a single point, average sampling takes the weighted sum of function values around the point. Such a sampling strategy is more practical and more stable. In this note, we present an explicit method with an…

Information Theory · Computer Science 2014-12-23 Wenjian Chen , Haizhang Zhang

We consider the reconstruction of a bandlimited function from its finite localized sample data. Truncating the classical Shannon sampling series results in an unsatisfactory convergence rate due to the slow decayness of the sinc function.…

Information Theory · Computer Science 2016-01-08 Rongrong Lin , Haizhang Zhang

In this paper, we discuss some numerical realizations of Shannon's sampling theorem. First we show the poor convergence of classical Shannon sampling sums by presenting sharp upper and lower bounds of the norm of the Shannon sampling…

Numerical Analysis · Mathematics 2025-04-17 Melanie Kircheis , Daniel Potts , Manfred Tasche

We study the problem of sampling a random signal with sparse support in frequency domain. Shannon famously considered a scheme that instantaneously samples the signal at equispaced times. He proved that the signal can be reconstructed as…

Information Theory · Computer Science 2012-11-22 Adel Javanmard , Andrea Montanari

The fast reconstruction of a bandlimited function from its sample data is an essential problem in signal processing. In this paper, we consider the widely used Gaussian regularized Shannon sampling formula in comparison to regularized…

Numerical Analysis · Mathematics 2025-06-09 Melanie Kircheis , Daniel Potts , Manfred Tasche

In the field of signal processing, the sampling theorem plays a fundamental role for signal reconstruction as it bridges the gap between analog and digital signals. Following the celebrated Nyquist-Shannon sampling theorem, generalizing the…

Information Theory · Computer Science 2024-07-23 Zhexuan Zeng , Jun Liu , Ye Yuan

Signal sampling and reconstruction is a fundamental engineering task at the heart of signal processing. The celebrated Shannon-Nyquist theorem guarantees perfect signal reconstruction from uniform samples, obtained at a rate twice the…

Signal Processing · Electrical Eng. & Systems 2020-02-19 Charilaos I. Kanatsoulis , Xiao Fu , Nicholas D. Sidiropoulos , Mehmet Akçakaya

Due to excessive need for faster propagations of signals and necessity to reduce number of measurements and rapidly increase efficiency, new sensing theories have been proposed. Conventional sampling approaches that follow Shannon-Nyquist…

Signal Processing · Electrical Eng. & Systems 2019-02-21 Milan Resetar , Gojko Ratkovic , Svetlana Zecevic

The classical sampling Nyquist-Shannon-Kotelnikov theorem states that a band-limited continuous time function can be uniquely recovered without error from a infinite two-sided sampling series taken with a sufficient frequency. This short…

Information Theory · Computer Science 2016-03-22 Nikolai Dokuchaev

Universal (pointwise uniform and time shifted) truncation error upper bounds are presented for the Whittaker--Kotel'nikov--Shannon (WKS) sampling restoration sum for Bernstein function classes $B_{\pi,d}^q,\, q>1,\, d\in \mathbb N$, when…

Information Theory · Computer Science 2013-07-15 Andriy Olenko , Tibor K. Pogány

The paper investigates possibility of recovery of sequences from their decimated subsequences. It is shown that this recoverability is associated with certain spectrum degeneracy of a new kind, and that a sequences of a general kind can be…

Information Theory · Computer Science 2017-10-31 Nikolai Dokuchaev

Shannon's sampling theorem is one of the cornerstone topics that is well understood and explored, both mathematically and algorithmically. That said, practical realization of this theorem still suffers from a severe bottleneck due to the…

Information Theory · Computer Science 2020-12-02 Ayush Bhandari , Felix Krahmer , Ramesh Raskar

Sampling theory has benefited from a surge of research in recent years, due in part to the intense research in wavelet theory and the connections made between the two fields. In this survey we present several extensions of the Shannon…

Information Theory · Computer Science 2008-12-17 Y. C. Eldar , T. Michaeli

The article starts with generalizations of some classical results and new truncation error upper bounds in the sampling theorem for bandlimited stochastic processes. Then, it investigates $L_p([0,T])$ and uniform approximations of…

Probability · Mathematics 2016-06-06 Yuriy Kozachenko , Andriy Olenko

Universal (pointwise uniform and time shifted) truncation error upper bounds are presented in Whittaker--Kotel'nikov--Shannon (WKS) sampling restoration sum for Bernstein function class $B_{\pi,d}^q\,,\ q \ge 1,$ $d\in \mathbb N\,,$ when…

Information Theory · Computer Science 2013-07-15 Andriy Olenko , Tibor K. Pogány

Shannon's sampling theorem provides a link between the continuous and the discrete realms stating that bandlimited signals are uniquely determined by its values on a discrete set. This theorem is realized in practice using so called…

Information Theory · Computer Science 2017-11-10 Ayush Bhandari , Felix Krahmer , Ramesh Raskar
‹ Prev 1 2 3 10 Next ›