# fast Fourier transform

> 𝑂(𝑁 log 𝑁) divide‐and‐conquer algorithm to calculate the discrete Fourier transforms

**Wikidata**: [Q623950](https://www.wikidata.org/wiki/Q623950)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Fast_Fourier_transform)  
**Source**: https://4ort.xyz/entity/fast-fourier-transform


## References

1. Freebase Data Dumps. 2013
2. [fast-fourier-transform · GitHub Topics · GitHub](https://github.com/topics/fast-fourier-transform)
3. [fft · GitHub Topics · GitHub](https://github.com/topics/fft)
4. [OpenAlex](https://docs.openalex.org/download-snapshot/snapshot-data-format)