|
|
@ -1,8 +1,10 @@ |
|
|
|
# FFT |
|
|
|
# FFT [![Version][version-img]][version-url] [![Status][status-img]][status-url] |
|
|
|
|
|
|
|
The package provides an [algorithm][1] to compute the [discrete Fourier |
|
|
|
transform][2] and its inverse. |
|
|
|
|
|
|
|
## [Documentation][doc] |
|
|
|
|
|
|
|
## Contributing |
|
|
|
|
|
|
|
1. Fork the project. |
|
|
@ -11,3 +13,9 @@ transform][2] and its inverse. |
|
|
|
|
|
|
|
[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 |