Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Any benchmarks / implementation notes? #33

Open
bluenote10 opened this issue May 16, 2020 · 2 comments
Open

Any benchmarks / implementation notes? #33

bluenote10 opened this issue May 16, 2020 · 2 comments

Comments

@bluenote10
Copy link

bluenote10 commented May 16, 2020

First of all, thanks for maintaining this crate, much appreciated!

Did you by any chance benchmark this crate against RustFFT or fourier? It looks like they also put some effort into optimizing it, so without benchmarks it is hard to judge if they are on a similar level.

Would also be intersting to benchmark against arrayfire::fft or rgsl::fft to see how pure Rust compares against other solutions.

If there are no benchmarks, maybe you can share what is unique / different about the approach taken in this implementation. Presumably there was a motivation to do something different then RustFFT?

@antimora
Copy link

@bluenote10 looks like your question remains unanswered. I wanted to ask you in your research were you able to find a good FFT library for Rust? By good, I mean correctly implemented, relatively fast and works without external dependencies.

@bluenote10
Copy link
Author

bluenote10 commented Oct 16, 2020

So far I was simply using rustfft, which works well for what I've been doing, but I didn't make much of a comparison.

Perhaps this thread / link might also be helpful.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants