(New page: = 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)...) |
|||
| Line 1: | Line 1: | ||
= Lecture 18 Blog, [[ECE438]] Fall 2010, [[User:Mboutin|Prof. Boutin]] = | = Lecture 18 Blog, [[ECE438]] Fall 2010, [[User:Mboutin|Prof. Boutin]] = | ||
| − | Monday October 4, 2010. | + | Monday October 4, 2010 (Week 7) - See [[Lecture_Schedule_ECE438Fall10_Boutin|Course Outline]]. |
---- | ---- | ||
Latest revision as of 04:36, 27 October 2010
Lecture 18 Blog, ECE438 Fall 2010, Prof. Boutin
Monday October 4, 2010 (Week 7) - See Course Outline.
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
