Video Lectures
Lecture 18: Computation of the Discrete Fourier Transform, Part 1
Topics covered: Direct computation of the discrete-time Fourier transform, computation resulting from successive decimation of the sequences, the decimation-in-time form of the fast Fourier transform (FFT) algorithm, basic butterfly computation.
Instructor: Prof. Alan V. Oppenheim
Course Info
Instructor
Departments
As Taught In
Spring
2011
Level
Course Info
Instructor
Departments
As Taught In
Spring
2011
Level
Learning Resource Types
notes
Lecture Notes
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
