KnowraFast Fourier transformLinked fromLinked fromThe 14 pages that link to Fast Fourier transform, each with the reason it gives.All 14Broader topic 3Related 8Compared with 3Fourier analysisRelated: It makes large-scale discrete frequency analysis computationally practical.Chinese remainder theoremRelated: Number-theoretic transforms use modular arithmetic and sometimes recombine residues by this theorem.MultiplicationRelated: Polynomial multiplication can be accelerated by transforming coefficients, multiplying pointwise, and transforming back.Discrete Fourier transformRelated: It exploits symmetries in the DFT to reduce computation from quadratic to roughly n log n.Chebyshev polynomialsRelated: Chebyshev coefficients can be computed efficiently by transforming sampled function values.Orthogonal frequency-division multiplexingRelated: Practical OFDM transmitters and receivers use FFT algorithms to process subcarriers.Fourier coefficientRelated: It makes large collections of frequency coefficients practical to calculate.Mersenne primeRelated: Large-prime searches use fast multiplication techniques built around Fourier transforms.