Module fft 

Contains fft::FFTAlgorithm, an abstraction for algorithms for computing FFTs over various rings, together with different implementations.

Modules

bluestein

Contains the implementation bluestein::BluesteinFFT of the Bluestein FFT algorithm to compute the FFT for arbitrary lengths.

complex_fft

Contains complex_fft::FFTErrorEstimate which provides estimates for the error when computing a complex-valued FFT using floating-point numbers.

cooley_tuckey

Contains the implementation cooley_tuckey::CooleyTuckeyFFT of the Cooley-Tukey FFT algorithm to compute the FFT for power-of-two lengths.

factor_fft

Contains the implementation factor_fft::GeneralCooleyTukeyFFT of the Cooley-Tukey algorithm to compute the FFT for lengths that are the product of two coprime factors.

radix3

Contains the implementation radix3::CooleyTukeyRadix3FFT of the Cooley-Tukey FFT algorithm to compute the FFT for power-of-three lengths.

Traits

FFTAlgorithm

Trait for objects that can perform a fast fourier transform over some ring.