Lecture 18: Computation of the Discrete Fourier Transform, Part 1

Name: Lecture 18: Computation of the Discrete Fourier Transform, Part 1
Uploaded: 2011-12-07T00:34:28Z
Duration: 48 min 57 s
Description: 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

48:57

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