A Fourier transform (FT) converts a signal from the time domain (signal strength as a function of time) to the frequency domain (signal strength as a function of frequency). It shows the signal's spectral content, divided into discrete bins (frequency bands).
The Fast Fourier Transform is a common algorithm for Fourier transforms. It is more efficient (faster) than the DFT, Discrete Fourier Transform.
- Fast Fourier Transform
- Fourier Transform
- Discrete Fourier Transform
Find a term alphabetically:
Comment on This Term (Corrections, Suggestions, etc.)
Suggest Another Term We Should Add