# Whittaker–Shannon interpolation formula

This article needs additional citations for verification. (March 2013) (Learn how and when to remove this template message) |

The **Whittaker–Shannon interpolation formula** or **sinc interpolation** is a method to construct a continuous-time bandlimited function from a sequence of real numbers. 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. It is also commonly called **Shannon's interpolation formula** and **Whittaker's interpolation formula**. E. T. Whittaker, who published it in 1915, called it the **Cardinal series**.

## Contents

## DefinitionEdit

Given a sequence of real numbers, *x*[*n*], 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 |*f*| ≤ 1/(2*T*). When parameter *T* has units of seconds, the **bandlimit**, 1/(2*T*), has units of cycles/sec (hertz). When the *x*[*n*] sequence represents time samples, at interval *T*, of a continuous function, the quantity *f*_{s} = 1/*T* is known as the sample rate, and *f*_{s}/2 is the corresponding Nyquist frequency. When the sampled function has a bandlimit, *B*, less than the Nyquist frequency, *x*(*t*) is a **perfect reconstruction** of the original function. (See Sampling theorem.) Otherwise, the frequency components above the Nyquist frequency "fold" into the sub-Nyquist region of *X*(*f*), resulting in distortion. (See Aliasing.)

## Equivalent formulation: convolution/lowpass filterEdit

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.

## ConvergenceEdit

The interpolation formula always converges absolutely and locally uniformly as long as

By the Hölder inequality this is satisfied if the sequence belongs to any of the spaces with 1 ≤ *p* < ∞, that is

This condition is sufficient, but not necessary. For example, the sum will generally converge if the sample sequence comes from sampling almost any stationary process, in which case the sample sequence is not square summable, and is not in any space.

## Stationary random processesEdit

If *x*[*n*] is an infinite sequence of samples of a sample function of a wide-sense stationary process, then it is not a member of any or L^{p} space, with probability 1; that is, the infinite sum of samples raised to a power *p* does not have a finite expected value. Nevertheless, the interpolation formula converges with probability 1. 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. If the process mean is nonzero, then pairs of terms need to be considered to also show that the expected value of the truncated terms converges to zero.

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.

## See alsoEdit

- Aliasing, Anti-aliasing filter, Spatial anti-aliasing
- Fourier transform
- Rectangular function
- Sampling (signal processing)
- Signal (electronics)
- Sinc function, Sinc filter
- Lanczos resampling