Fourier transform
lastmod 2026-01-11created 2014-10-1223 edits
The Fourier transform decomposes a function of time (e.g. a signal) into its frequencies. This is similar to expressing a musical chord by the amplitudes (loudness) of the notes that make it up. The Fourier transform of a function of time is a complex-valued function of frequency, whose absolute value represents how much of that frequency is present in the original function.
The Fourier transform is a linear transform that takes one function as an argument and transforms it into another function. The transformed function is generally called the frequency-domain representation of the original function.
Fast Fourier transform
- Wikipedia (en) explanation of the fast Fourier transform
- Fourier transform formulas
- Fast Fourier Transform
The fast Fourier transform (FFT) is an efficient algorithm that quickly computes the discrete Fourier transform (DFT) and its inverse. FFT is used in many fields, from digital signal processing to algorithms for finding the roots of partial differential equations.
Discrete Fourier transform
The discrete Fourier transform (DFT) is the Fourier transform of a discrete input signal, used in fields such as digital signal analysis. The discrete Fourier transform can be computed quickly using the fast Fourier transform.
Documentation
-
Fourier_analysis_made_easy_-_part_1.pdf -
Fourier_analysis_made_easy_-_part_2.pdf
Libraries
List of libraries:
See also
Favorite site
- Wikipedia (en) explanation of the Fourier transform
- Collection of posts on the Fourier transform
- ICT terminology glossary - Fourier Transform 1
- The beginning of the Fourier series (Fourier series) 2
- A younger brother better than the elder: the Fourier transform (Fourier transform) 3
- [Recommended] Fourier transform (fourier transform) (basic explanation, with Python code) 4
- [Recommended] An interactive introduction to the Fourier transform
- The unreasonable effectiveness of the Fourier transform | GeekNews
- A talk showing how powerfully the Fourier transform works in real-world technical applications
Project
Sample code
- Simple DFT in C
- cips2edsrc DFT.C
- How to implement the discrete Fourier transform
- nolandda.org: dft.c
- [Recommended] DFT in c code 5