|
|
|
|
proof of sampling theorem
|
(Proof)
|
|
|
Let be the (two-sided) bandwidth. The variable below will denote frequency, and the variable will denote time. (Both and are measured in cycles per unit time.)
Consider the space of functions:
 for almost all 
which is clearly seen to be a complex Hilbert space with the usual inner product for
.
Let
denote the Fourier transform on
, which is a unitary transform by Plancherel's theorem. So,
 for almost all 
is also a Hilbert space.
One orthonormal basis for
consists of the usual Fourier basis functions on the interval
, extended to be zero on
:
Mapping these by
produces an orthonormal basis for
:
where we have used the fact that the Fourier transform of
(normalized sinc function) is the rectangular box function of bandwidth , and vice versa.
Given
, let
. We can expand in a Fourier series with respect to the basis
:
with the infinite sum converging in
. Taking
of both sides, we obtain:
Moreover,
(Since is also in
, its inverse Fourier transform
is a continuous function. Provided that we modify on a set of measure zero, we can assume that
is continuous. So it is legal to talk about the pointwise values .)
Hence, we arrive at the representation:
thereby reconstructing any
-- a square-integrable band-limited function -- from its samples at every time period of length .
The infinite series for converges in
by construction, but in fact it also converges uniformly and absolutely. To see this, first note that by the Cauchy-Schwarz inequality,
The series
converges by Parseval's theorem (
are the Fourier coefficients of ). Also, the series
is uniformly bounded for all
. To prove this, it suffices to restrict to bounded inside as the function
is -periodic; and then it becomes an easy estimate using the fact that
. It follows that the series
is uniformly bounded for all , and its tail tends to zero uniformly in .
Figure: Reconstructing a Bessel function (of the first kind), using a
series with
. Theoretically exact bandwidth is
.
|
|
Figure: Effect of under-sampling and over-sampling beyond the actual bandwidth of the function
|
|
Figure: The basis functions
,
,
|
|
|
"proof of sampling theorem" is owned by stevecheng.
|
|
(view preamble)
Cross-references: bounded, Fourier coefficients, Parseval's theorem, Cauchy-Schwarz inequality, converges uniformly, converges, series, period, pointwise, measure zero, continuous function, inverse, sum, infinite, Fourier series, expand, sinc function, mapping, interval, functions, orthonormal basis, Plancherel's theorem, Transform, unitary, Fourier transform, inner product, Hilbert space, complex, space of functions, variable
This is version 10 of proof of sampling theorem, born on 2006-12-21, modified 2007-06-30.
Object id is 8650, canonical name is ProofOfSamplingTheorem.
Accessed 1505 times total.
Classification:
| AMS MSC: | 94A20 (Information and communication, circuits :: Communication, information :: Sampling theory) | | | 42A38 (Fourier analysis :: Fourier analysis in one variable :: Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|