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

Om kurset

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