Expand description
§Fast Fourier Transform Module - High-Performance Frequency Domain Analysis
This module implements optimised Fast Fourier Transform (FFT) algorithms for efficient frequency domain analysis and signal processing applications. It provides both small-scale radix-optimised transforms and large-scale blocked implementations for scientific computing and digital signal processing workflows.
§Use cases
The Fast Fourier Transform is fundamental to numerous computational domains:
- Digital Signal Processing: Spectral analysis, filtering, and convolution
- Image Processing: Frequency domain transformations and enhancement
- Scientific Computing: Numerical solution of PDEs via spectral methods
- Audio Processing: Frequency analysis and synthesis
- Telecommunications: Modulation, demodulation, and channel analysis
- Machine Learning: Feature extraction and data preprocessing
Functions§
- block_
fft - Power-of-two, in-place FFT (≥8, radix-2 stages, radix-8 leaf).
- butterfly_
radix8 - fft8_
radix - 8-point FFT 8-point FFT (radix-2/4 DIT): split evens/odds -> FFT4 each -> twiddle & combine.