<< Chapter < Page Chapter >> Page >
Proof of Shannon's sampling theorem

In order to recover the signal x t from it's samples exactly, it is necessary to sample x t at a rate greater than twice it's highest frequency component.

Introduction

As mentioned earlier , sampling is the necessary fundament when we want to apply digital signalprocessing on analog signals.

Here we present the proof of the sampling theorem. The proof is divided in two. First we find an expression for the spectrum of the signal resulting fromsampling the original signal x t . Next we show that the signal x t can be recovered from the samples. Often it is easier using the frequency domain when carrying out a proof,and this is also the case here.

    Key points in the proof

  • We find an equation for the spectrum of the sampled signal
  • We find a simple method to reconstruct the original signal
  • The sampled signal has a periodic spectrum...
  • ...and the period is 2 π F s

Proof part 1 - spectral considerations

By sampling x t every T s second we obtain x s n . The inverse fourier transform of this time discrete signal is

x s n 1 2 π ω π X s ω ω n
For convenience we express the equation in terms of the real angular frequency Ω using ω Ω T s .We then obtain
x s n T s 2 Ω π T s π T s X s Ω T s Ω T s n
The inverse fourier transform of a continuous signal is
x t 1 2 Ω X Ω Ω t
From this equation we find an expression for x n T s
x n T s 1 2 Ω X Ω Ω n T s
To account for the difference in region of integration we split the integration in into subintervals of length 2 π T s and then take the sum over the resulting integrals to obtain the complete area.
x n T s 1 2 π k Ω 2 k 1 T s 2 k 1 T s X Ω Ω n T s
Then we change the integration variable, setting Ω η 2 π k T s
x n T s 1 2 π k η T s π T s X η 2 π k T s η 2 π k T s n T s
We obtain the final form by observing that 2 π k n 1 , reinserting η Ω and multiplying by T s T s
x n T s T s 2 π Ω π T s π T s k 1 T s X Ω 2 π k T s Ω n T s
To make x s n x n T s for all values of n , the integrands in and have to agreee, that is
X s Ω T s 1 T s k X Ω 2 k T s
This is a central result. We see that the digital spectrum consists of a sum of shifted versions of the original, analog spectrum. Observe the periodicity!

We can also express this relation in terms of the digital angular frequency ω Ω T s

X s ω 1 T s k X ω 2 π k T s
This concludes the first part of the proof. Now we want to find a reconstruction formula, so that we can recover x t from x s n .

Proof part ii - signal reconstruction

For a bandlimited signal the inverse fourier transform is

x t 1 2 Ω T s T s X Ω Ω t
In the interval we are integrating we have: X s Ω T s X Ω T s . Substituting this relation into we get
x t T s 2 Ω T s T s X s Ω T s Ω t
Using the DTFT relation for X s Ω T s we have
x t T s 2 Ω T s T s n x s n Ω n T s Ω t
Interchanging integration and summation (under the assumption of convergence) leads to
x t T s 2 n x s n Ω T s T s Ω t n T s
Finally we perform the integration and arrive at the important reconstruction formula
x t n x s n T s t n T s T s t n T s
(Thanks to R.Loos for pointing out an error in the proof.)

Summary

X s Ω T s 1 T s k X Ω 2 k T s

x t n x s n T s t n T s T s t n T s

Go to

  • Introduction
  • Illustrations
  • Matlab Example
  • Hold operation
  • Aliasing applet
  • System view
  • Exercises
?

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Fundamentals of signal processing. OpenStax CNX. Nov 26, 2012 Download for free at http://cnx.org/content/col10360/1.4
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Fundamentals of signal processing' conversation and receive update notifications?

Ask