You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
# FFT [![Version][version-img]][version-url] [![Status][status-img]][status-url]
The package provides an [algorithm][1] to compute the [discrete Fouriertransform][2] and its inverse.
## [Documentation][doc]
## Contributing
1. Fork the project.2. Implement your idea.3. Open a pull request.
[1]: https://en.wikipedia.org/wiki/Fast_Fourier_transform[2]: https://en.wikipedia.org/wiki/Discrete_Fourier_transform
[version-img]: https://img.shields.io/crates/v/fft.svg[version-url]: https://crates.io/crates/fft[status-img]: https://travis-ci.org/stainless-steel/fft.svg?branch=master[status-url]: https://travis-ci.org/stainless-steel/fft[doc]: https://stainless-steel.github.io/complex
|
