Long employed in electrical engineering, the discrete Fourier transform (DFT) is now applied in a range of fields through the use of digital computers and fast Fourier transform (FFT) algorithms. But to correctly interpret DFT results, it is essential to understand the core and tools of Fourier analysis. Discrete and Continuous Fourier Transform

part I|26 pages

Fundamentals, Analysis and Applications

part II|2 pages

Fast Algorithms

chapter 11|16 pages

Index Mapping and Mixed-Radix FFTs

chapter 12|20 pages

Kronecker Product Factorization and FFTs

chapter 13|34 pages

The Family of Prime Factor FFT Algorithms

chapter 14|14 pages

On Computing the DFT of Large Prime Length