The formula dates back to the works of E. Borel in 1898, and E. T. Whittaker in 1915, and was cited from works of J. M. Whittaker in 1935, and in the formulation of the Nyquist–Shannon sampling theorem by Claude Shannon in 1949.
Given a sequence of real numbers, x[n]=x(nT), the continuous function (where "sinc" denotes the normalized sinc function) has a Fourier transform, X(f), whose non-zero values are confined to the region :
The interpolation formula is derived in the Nyquist–Shannon sampling theorem article, which points out that it can also be expressed as the convolution of an infinite impulse train with a sinc function: This is equivalent to filtering the impulse train with an ideal (brick-wall) low-pass filter with gain of 1 (or 0 dB) in the passband.
If the sample rate is sufficiently high, this means that the baseband image (the original signal before sampling) is passed unchanged and the other images are removed by the brick-wall filter.
The interpolation formula always converges absolutely and locally uniformly as long as By the Hölder inequality this is satisfied if the sequence
or Lp space, with probability 1; that is, the infinite sum of samples raised to a power p does not have a finite expected value.
Convergence can readily be shown by computing the variances of truncated terms of the summation, and showing that the variance can be made arbitrarily small by choosing a sufficient number of terms.
Since a random process does not have a Fourier transform, the condition under which the sum converges to the original function must also be different.
A stationary random process does have an autocorrelation function and hence a spectral density according to the Wiener–Khinchin theorem.
A suitable condition for convergence to a sample function from the process is that the spectral density of the process be zero at all frequencies equal to and above half the sample rate.