Editing Fast Fourier transform (section)

==See also==
FFT-related algorithms:

* [[Bit-reversal permutation]]
* [[Goertzel algorithm]] – computes individual terms of discrete Fourier transform

FFT implementations:
* [[ALGLIB]] – a dual/GPL-licensed C++ and C# library (also supporting other languages), with real/complex FFT implementation
* [[FFTPACK]] – another Fortran FFT library (public domain)
* Architecture-specific:
** Arm Performance Libraries<ref name="Arm Performance Libraries">{{cite web|date=2020 |title=Arm Performance Libraries |publisher=[[Arm]] |url=https://www.arm.com/products/development-tools/server-and-hpc/allinea-studio/performance-libraries |access-date=2020-12-16}}</ref>
** Intel [[Integrated Performance Primitives]]
** Intel [[Math Kernel Library]]
* Many more implementations are available,<ref>{{Cite web|date=2020-04-05|title=Complete list of C/C++ FFT libraries|url=https://community.vcvrack.com/t/complete-list-of-c-c-fft-libraries/9153|access-date=2021-03-03|website=VCV Community|language=en}}</ref> for CPUs and GPUs, such as PocketFFT for C++

Other links:
* [[Odlyzko–Schönhage algorithm]] applies the FFT to finite [[Dirichlet series]]
* [[Schönhage–Strassen algorithm]] – asymptotically fast multiplication algorithm for large integers
* [[Butterfly diagram]] – a diagram used to describe FFTs
* [[Spectral music]] (involves application of DFT analysis to musical composition)
* [[Spectrum analyzer]] – any of several devices that perform spectrum analysis, often via a DFT
* [[Time series]]
* [[Fast Walsh–Hadamard transform]]
* [[Generalized distributive law]]
* [[Least-squares spectral analysis]]
* [[Multidimensional transform]]
* [[Multidimensional discrete convolution]]
* [[Fast Fourier Transform Telescope]]