Expand description
FFTW-based FFT backend for high performance
Provides 62x speedup over pure Rust FFT implementation by using the industry-standard FFTW library.
Now with plan caching for even better performance on repeated transforms.
Functionsยง
- dct2_
fftw - DCT Type II using FFTW with plan caching (REDFT10) This is the most commonly used DCT type
- dst2_
fftw - DST Type II using FFTW with plan caching (RODFT10)
- fft2_
fftw - 2D complex-to-complex FFT using FFTW with plan caching
- fft_
fftw - Complex-to-complex FFT using FFTW with plan caching
- idct2_
fftw - IDCT Type II using FFTW with plan caching (REDFT01 = DCT-III) DCT-III is the inverse of DCT-II
- idst2_
fftw - IDST Type II using FFTW with plan caching (RODFT01 = DST-III)
- ifft2_
fftw - 2D inverse complex-to-complex FFT using FFTW with plan caching
- ifft_
fftw - Inverse complex-to-complex FFT using FFTW with plan caching
- irfft2_
fftw - 2D inverse real FFT using FFTW with plan caching
- irfft_
fftw - Inverse real FFT using FFTW with plan caching
- rfft2_
fftw - 2D real-to-complex FFT using FFTW with plan caching
- rfft_
fftw - Real-to-complex FFT using FFTW with plan caching