This lecture covers rearrangements of the basic decimation-in-frequency algorithm and discuss the relation between decimation-in-time and decimation-in-frequency through the transposition theorem. It also covers more general arbitrary radix FFT algorithms.

This lecture discusses interpretation of the FFT flow graph and bit-reversed data ordering. It also discusses other decimation-in-time FFT algorithms by rearranging the flow graph and the decimation-in-frequency FFT algorithm.

This lectures covers different methods of computation of the discrete Fourier transform, including direct computation, successive decimation of the sequences, the decimation-in-time form of the FFT algorithm, and basic butterfly computation.