Sampling-50 years after Shannon

  title={Sampling-50 years after Shannon},
  author={Michael A. Unser},
  journal={Proceedings of the IEEE},
  • M. Unser
  • Published 1 April 2000
  • Computer Science
  • Proceedings of the IEEE
This paper presents an account of the current state of sampling, 50 years after Shannon's formulation of the sampling theorem. The emphasis is on regular sampling, where the grid is uniform. This topic has benefitted from a strong research revival during the past few years, thanks in part to the mathematical connections that were made with wavelet theory. To introduce the reader to the modern, Hilbert-space formulation, we reinterpret Shannon's sampling procedure as an orthogonal projection… 

Figures and Tables from this paper

Behavior of Shannon's Sampling Series with Applications
It is shown not only that the Shannon sampling series diverges for this signal, but also that there is no bounded, bandlimited interpolation at all.
Generalizations of the sampling theorem: Seven decades after Nyquist
Some of the less known aspects of sampling are presented, with special emphasis on non bandlimited signals, pointwise stability of reconstruction, and reconstruction from nonuniform samples.
Optimal wavelet reconstructions from Fourier samples via generalized sampling
The recently introduced framework of generalized sampling in the context of compactly supported orthonormal wavelet bases is used, and it is demonstrated that using generalized sampling one obtains a stable and accurate reconstruction, provided the number of Fourier samples grows linearly in thenumber of wavelet coefficients recovered.
Convergence Analysis of the Gaussian Regularized Shannon Sampling Series
The main objective of this article is to show that the Gaussian regularization of the Shannon series can also achieve the same best convergence rate as that by C. Micchelli et al. and can improve the convergence rate for the useful average sampling.
On a Non-Fourier Generalization of Shannon Sampling Theory
  • Yufang Hao, A. Kempf
  • Computer Science
    2007 10th Canadian Workshop on Information Theory (CWIT)
  • 2007
New results are presented on an approach that makes use of powerful functional analytic methods to generalize Shannon sampling to allow varying Nyquist rates.
Torwards a general formulation for over-sampling and under-sampling
This work revisits a conventional definition of over-sampled and under-sampling in a general setting, and introduces the two notions of `perfect reconstruction' and `redundant sampling,' which are shown to be geometrically characterized by using sampling and reconstruction spaces.
Nonideal Sampling and Regularization Theory
A stochastic interpretation of the reconstruction algorithm is proposed and an equivalence with the minimax and minimum mean square error (MMSE/Wiener) solutions of the generalized sampling problem is established.
Sub-Nyquist Sampling: Bridging Theory and Practice
This paper reviews sampling strategies which target reduction of the ADC rate below Nyquist, and covers classic works from the early 50's of the previous century through recent publications from the past several years, with a prime focus on bridging theory and practice.
Convergence Analysis of the Gaussian Regularized Shannon Sampling Formula
The main objective of this note is to show that the Gaussian regularization of the Shannon series can also achieve the same best convergence rate as that by C. Micchelli et al.


The Shannon sampling theorem—Its various extensions and applications: A tutorial review
It has been almost thirty years since Shannon introduced the sampling theorem to communications theory. In this review paper we will attempt to present the various contributions made for the sampling
Sampling procedures in function spaces and asymptotic equivalence with shannon's sampling theory
We view Shannon's sampling procedure as a problem of approximation in the space S = {s: s (x) = (c * sinc)(x)c e l 2}. We show that under suitable conditions on a generating function λ e L 2, the
Generalized sampling theorems in multiresolution subspaces
This paper extends the existing sampling theory for wavelet subspaces in several directions, and extends the sampling theory to random processes, where it turns out that one cannot recover random processes themselves but only their power spectral density functions.
On the approximation power of convolution-based least squares versus interpolation
This work reviews several results in approximation theory with a special emphasis on the Strang-Fix (1971) conditions, which relate the general O(h/sup L/) behavior of the error to the ability of the representation to reproduce polynomials of degree n=L-1, and obtains the asymptotic limit of the L/sub 2/-error as h tends to zero.
Sampling Theory for not Necessarily Band-Limited Functions: A Historical Overview
The aim of this overview is to show that one of its roots is a basic paper of de la Vallee Poussin of 1908, and the historical development of sampling theory from 1908 to the present, especially the matter dealing with not necessarily band-limited functions.
Quantitative Fourier analysis of approximation techniques. II. Wavelets
  • T. Blu, M. Unser
  • Mathematics, Computer Science
    IEEE Trans. Signal Process.
  • 1999
A general Fourier method that provides an accurate prediction of the approximation error, irrespective of the scaling properties of the approximating functions is proposed, and sharp, asymptotically optimal upper bounds for the least-squares approximation error are computed.
Quantitative Fourier analysis of approximation techniques. I. Interpolators and projectors
It is shown how to design quasi-interpolators that are near optimal in the least-squares sense, and the remarkable property of providing a global error estimate that is the average of the true approximation error over all possible shifts of the input function.
A general sampling theory for nonideal acquisition devices
The authors first describe the general class of approximation spaces generated by translation of a function /spl psi/(x), and provide a full characterization of their basis functions. They then
Generalized sampling without bandlimiting constraints
  • M. Unser, J. Zerubia
  • Computer Science
    1997 IEEE International Conference on Acoustics, Speech, and Signal Processing
  • 1997
We investigate the problem of the reconstruction of a continuous-time function f(x)/spl isin//spl Hscr/ from the responses of m linear shift-invariant systems sampled at 1/m the reconstruction rate,
General sampling theorems for functions in reproducing kernel Hilbert spaces
In this paper we prove general sampling theorems for functions belonging to a reproducing kernel Hilbert space (RKHS) which is also a closed subspace of a particular Sobolev space. We present details