Live briefing
Everything about Fast Fourier transform
Discrete Fourier transform algorithm
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT), or its inverse (IDFT), of a sequence. A Fourier transform converts a signal from its original domain to a representation in the frequency domain and vice versa. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Fast Fourier transformA 5-minute orientation
- Skim a recent paper: A structured review of sparse fast Fourier transform algorithmsInfluential work since 2022
- Pick up a classic book: Spectrum and network measurementsThe most-reprinted book on the subject
- Read the landmark paper: MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transformCited 16,270 times
- Go sideways: Vector-radix FFT algorithmA closely related topic
- Go sideways: Discrete Hartley transformA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform
The use of fast Fourier transform for the estimation of power spectra: A method based on time averaging over short, modified periodograms
The fast Fourier transform
What is the fast Fourier transform?
Real-valued fast Fourier transform algorithms
Fast and accurate Polar Fourier transform
Integer fast Fourier transform
Nonuniform fast Fourier transform
🆕 Influential since 2022
A structured review of sparse fast Fourier transform algorithms
An ultra-precise Fast Fourier Transform
Energy-Efficient Fast Fourier Transform for Real-Valued Applications
Interpolating Nonadiabatic Molecular Dynamics Hamiltonian with Inverse Fast Fourier Transform
A fast Fourier transform-based solver for elastic micropolar composites
📚 Books worth reading
Spectrum and network measurementsRobert A. Witte · 1991- 📕Performing out-of core FFTS on parallel disk systemsThomas H. Cormen · 1996
- 📕A high-order direct solver for helmholtz equations with neumann boundary conditionsXian-He Sun · 1997
- 📕Spectral and spectral-element methodsAnil E. Deane · 1997
Pulse Doppler radarClive Alabaster · 2012
Lectures on the Fourier Transform and Its ApplicationsBrad G. Osgood · 2019- 📕Feasibility study, software design, layout and simulation of a two-dimensional fast Fourier transform machine for use in optical array interferometryValentín Boriakoff · 1994
DFTS on irregular gridsVan Emden Henson · 1992
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Vector-radix FFT algorithm The vector-radix FFT algorithm, is a multidimensional fast Fourier transform (FFT) algorithm, which is a generalization of the ordinary Cooley–Tukey FFT…
- Discrete Hartley transform A discrete Hartley transform (DHT) is a Fourier-related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous…
- Cooley–Tukey FFT algorithm The Cooley–Tukey algorithm, named after J. W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re-expresses the discrete…
- Discrete cosine transform A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies…
- Bruun's FFT algorithm Bruun's algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of two…
- Bailey's FFT algorithm Bailey's FFT (also known as a 4-step FFT) is a high-performance algorithm for computing the fast Fourier transform (FFT). This variation of the Cooley–Tukey…
- Split-radix FFT algorithm The split-radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an initially…
- Discrete Fourier transform In mathematics, the discrete Fourier transform (DFT) is a discrete version of the Fourier transform that converts a finite sequence of numbers into another…