Uses old Rust 2015
|0.1.0||Aug 11, 2015|
#34 in #fft
Rust shitty implementations of various FFT algorithms.
It works, but it's not optimized like FFTW3 and such, so use at your own peril.
[dependencies.rft] git = "https://github.com/meh/rft"
Rust Fourier Transform.
The length of the input must not be a power of two, it picks the proper algorithm automatically.
Cooley-Tukey is used for power of two sizes, it has an O(N log N) time complexity and O(N) space complexity.
Bluestein is used for non-power of two sizes, it has an O(5N log N) time complexity and O(5N) space complexity.
If it isn't already obvious, try to use power of two sizes.