RES.6-008 | Spring 2011 | Graduate
Digital Signal Processing
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

Transcript
Related Resources
Course Info
As Taught In
Spring 2011
Level
Learning Resource Types
assignment_turned_in Problem Sets with Solutions
notes Lecture Notes
theaters Lecture Videos