Line 14: Line 14:
 
Then x(t) is uniquely recoverable.
 
Then x(t) is uniquely recoverable.
  
 +
Here is a block diagram of sampling and reconstruction using a LPF:
 +
[[File:BlockDSamp|block diagram of sampling]]
  
 
[[ 2018 Spring ECE 301 Boutin|Back to 2018 Spring ECE 301 Boutin]]
 
[[ 2018 Spring ECE 301 Boutin|Back to 2018 Spring ECE 301 Boutin]]

Revision as of 15:10, 30 April 2018


Explanation of Sampling Theorem

The sampling theorem:

1. for x(nT) to be equally spaced samples of x(t), while n=0, +1, -1, +2, -2, ...
2. x(t) is band limited.
  X($ \omega $) = 0 for $ |\omega|>\omega_m $
3. $  2\pi/T = \omega_s > 2\omega_m $

Then x(t) is uniquely recoverable.

Here is a block diagram of sampling and reconstruction using a LPF: block diagram of sampling

Back to 2018 Spring ECE 301 Boutin

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood