Revision as of 15:16, 8 October 2010 by Mboutin (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Lecture 19 Blog, ECE438 Fall 2010, Prof. Boutin

Wednesday October 6, 2010.


We continued our discussion of the FFT by presenting the "Radix-two" algorithm for computing the DFT of a discrete-time signal with finite duration $ 2^M $. (Although technically, the DFT is used to transform periodic signals only, so to be correct, one should write "the DFT of the periodic repetition with period N of a signal with finite duration N"). If you found my diagrams hard to read on the board, I highly recommend reading Prof. Pollak's notes on the FFT.

We finished the lecture by beginning to discuss DT systems (definition and basic properties). Our emphasis this semester will be on "filtering".

Previous: Lecture 18; Next: Lecture 20


Back to 2010 Fall ECE 438 Boutin

Alumni Liaison

Basic linear algebra uncovers and clarifies very important geometry and algebra.

Dr. Paul Garrett