-
Notifications
You must be signed in to change notification settings - Fork 0
signal.Fft
Christian d'Heureuse edited this page Jun 6, 2026
·
1 revision
dsp-collection / signal/Fft
Fast Fourier Transform (FFT).
This module implements the following classic FFT algorithms:
- Cooley-Tukey (Radix-2)
- Bluestein It is not extremely optimized, but should be reasonably fast for normal purposes.
| Function | Description |
|---|---|
| fft | Computes the FFT of an array of complex numbers. |
| fftReal | Computes the FFT of an array of real numbers and returns the complex result. |
| fftRealHalf | Computes the lower half FFT of an array of real numbers and returns the lower half of the complex result. |
| fftRealSpectrum | Computes the complex spectrum of an array of real numbers. The result is the normalized lower half of the FFT. |
| fftShift | Shifts the zero-frequency component to the center of the spectrum. |
| iFftRealHalf | Computes the inverse FFT for a real signal. General version. |
| iFftRealHalfOpt | Computes the inverse FFT for a real signal. Optimized version. |
| iFftRealHalfSimple | Computes the inverse FFT for a real signal. Non-optimized version. |