Signal reconstruction

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In signal processing, reconstruction usually means the determination of an original continuous signal from a sequence of equally spaced samples.

This article takes a generalized abstract mathematical approach to signal sampling and reconstruction. For a more practical approach based on band-limited signals, see Whittaker–Shannon interpolation formula.

General principle[edit]

Let F be any sampling method, i.e. a linear map from the Hilbert space of square-integrable functions L^2 to complex space \Bbb C^n.

In our example, the vector space of sampled signals \Bbb C^n is n-dimensional complex space. Any proposed inverse R of F (reconstruction formula, in the lingo) would have to map \Bbb C^n to some subset of L^2. We could choose this subset arbitrarily, but if we're going to want a reconstruction formula R that is also a linear map, then we have to choose an n-dimensional linear subspace of L^2.

This fact that the dimensions have to agree is related to the Nyquist–Shannon sampling theorem.

The elementary linear algebra approach works here. Let d_k:=(0,...,0,1,0,...,0) (all entries zero, except for the kth entry, which is a one) or some other basis of \Bbb C^n. To define an inverse for F, simply choose, for each k, an e_k \in L^2 so that F(e_k)=d_k. This uniquely defines the (pseudo-)inverse of F.

Of course, one can choose some reconstruction formula first, then either compute some sampling algorithm from the reconstruction formula, or analyze the behavior of a given sampling algorithm with respect to the given formula.

Popular reconstruction formulae[edit]

Perhaps the most widely used reconstruction formula is as follows. Let \{ e_k \} be a basis of L^2 in the Hilbert space sense; for instance, one could use the eikonal

e_k(t):=e^{2\pi i k t}\,,

although other choices are certainly possible. Note that here the index k can be any integer, even negative.

Then we can define a linear map R by

R(d_k)=e_k\,

for each k=\lfloor -n/2 \rfloor,...,\lfloor (n-1)/2 \rfloor, where (d_k) is the basis of \Bbb C^n given by

d_k(j)=e^{2 \pi i j k \over n}

(This is the usual discrete Fourier basis.)

The choice of range k=\lfloor -n/2 \rfloor,...,\lfloor (n-1)/2 \rfloor is somewhat arbitrary, although it satisfies the dimensionality requirement and reflects the usual notion that the most important information is contained in the low frequencies. In some cases, this is incorrect, so a different reconstruction formula needs to be chosen.

A similar approach can be obtained by using wavelets instead of Hilbert bases. For many applications, the best approach is still not clear today.

See also[edit]