Lecture
The fast Fourier transform
Description
This lecture covers the history of the Fourier transform, from Gauss to the Cooley-Tukey FFT algorithm. It explains the concept of small DFT matrices, the divide-and-conquer approach for DFT, and the analysis of Decimation-in-Time FFT. The lecture demonstrates the matrix factorization view of DFT for different sizes, emphasizing the efficiency of the algorithm. It concludes with practical applications in image processing and the significant reduction in computational complexity compared to direct methods.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.