| Line 17: | Line 17: | ||
**Introduction | **Introduction | ||
| − | ** | + | **Sampling rate above Nyquist rate |
| − | ** | + | **Sampling rate below Nyquist rate |
| − | ** | + | **Conclusion |
| − | ** | + | **References |
==Introduction== | ==Introduction== | ||
| + | |||
| + | ==Sampling rate above Nyquist rate== | ||
| + | |||
| + | ==Sampling rate below Nyquist rate== | ||
| + | |||
| + | ==Conclusion== | ||
==References== | ==References== | ||
Revision as of 11:28, 27 September 2014
Discrete-time Fourier transform (DTFT) of a sampled cosine
A slecture by ECE student Yijun Han
Partly based on the ECE438 Fall 2014 lecture material of Prof. Mireille Boutin.
Contents
outline
- Introduction
- Sampling rate above Nyquist rate
- Sampling rate below Nyquist rate
- Conclusion
- References
Introduction
Sampling rate above Nyquist rate
Sampling rate below Nyquist rate
Conclusion
References
[1].Mireille Boutin, "ECE438 Digital Signal Processing with Applications," Purdue University August 26,2009
Questions and comments
If you have any questions, comments, etc. please post them on this page.
