fast Fourier transform
Sign in to saveAlso known as FFT, fast Fourier transformation
𝑂(𝑁 log 𝑁) divide‐and‐conquer algorithm to calculate the discrete Fourier transforms
In the Vinony graph
Vinony's link graph records 826 inbound references to fast Fourier transform, and connects out to Springer Science+Business Media, root of unity and spherical harmonic.
Vinony files it under Digital signal processing, Discrete transforms and Fast Fourier transforms.
Vinony links it to 30 Wikipedia language editions.
Wikidata facts
- Subclass of
- discrete Fourier transform
- Named after
- Joseph Fourier
- Developer
- John Tukey
Show 8 more facts
- Stack Exchange tag
- bioacoustics.stackexchange.com/tags/fft
- discoverer or inventor
- John Tukey
- topic's main category
- Category:Fast Fourier transforms
- computes solution to
- discrete Fourier transform
- has immediate cause
- sine wave
- short name
- TFR
- Commons category
- FFT
- maintained by WikiProject
- WikiProject Mathematics
Sources (3)
via Wikidata · CC0
Connections
Springer Science+Business Media
Entity
root of unity
Entity
spherical harmonic
Entity
Prentice Hall
Entity
James Cooley
Entity
Society for Industrial and Applied Mathematics
Entity
Bluestein's FFT algorithm
Entity
John F. Kennedy
Person
Carl Friedrich Gauss
Entity
International Standard Book Number
Entity
algorithm
Entity
Python
Entity
complex number
Entity
prime number
Entity
Joseph Fourier
Entity
number theory
Entity
central processing unit
Entity
Wayback Machine
Entity
digital object identifier
Entity
matrix
Entity