Lecture 18 Blog, ECE438 Fall 2010, Prof. Boutin
Monday October 4, 2010.
Recovering from the first midterm exam, we attacked the Fast Fourier Transform (FFT). More specifically, we illustrated how "decimating by a factor two" yield a significant decrease in the number of "complex operations" (CO) involved in the computation of a DFT.
Previous: Lecture 17; Next: Lecture 19
