This video presents an overview of the Fourier Transform, which is one of the most important transformations in all of mathematical physics and engineering. This series will introduce the analytic theory of the Fourier Transform, along with the Fast Fourier Transform (FFT) algorithm for efficient computations. We will explore lots of applications in image compression, audio analysis, and solving partial differential equations.
This book focuses on the discrete Fourier transform (DFT), discrete convolution, and, particularly, the fast algorithms to calculate them. These topics have been at the center of digital signal processing since its beginning, and new results in hardware, theory and applications continue to keep them important and exciting. This book uses an index map, a polynomial decomposition, an operator factorization, and a conversion to a filter to develop a very general and efficient description of fast algorithms to calculate the discrete Fourier transform (DFT). The work of Winograd is outlined, chapters by Selesnick, Pueschel, and Johnson are included, and computer programs are provided.
