(New page: ==Sampling Theorem== ===English Definition=== a signal x(t) can be uniquely recovered from its samples if the samples within x(nT))
 
Line 2: Line 2:
  
 
===English Definition===
 
===English Definition===
a signal x(t) can be uniquely recovered from its samples if the samples within x(nT)
+
a signal <math>x(t)</math> can be uniquely recovered from its samples if the samples within <math>x(nT)</math>, where n goes from <math>(-\infty,\infty)</math>, and T satisfies the nyquist rate, or <math>T < \frac{1}{2}\frac{2\pi}{\omega_m}</math>

Revision as of 16:23, 10 November 2008

Sampling Theorem

English Definition

a signal $ x(t) $ can be uniquely recovered from its samples if the samples within $ x(nT) $, where n goes from $ (-\infty,\infty) $, and T satisfies the nyquist rate, or $ T < \frac{1}{2}\frac{2\pi}{\omega_m} $

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood