diff options
| author | hayati ayguen <h_ayguen@web.de> | 2020-06-13 11:49:42 +0200 |
|---|---|---|
| committer | hayati ayguen <h_ayguen@web.de> | 2020-06-13 12:07:29 +0200 |
| commit | 305fa3435324e8f7ff8cf426f1b5c6a2c79e41f8 (patch) | |
| tree | cdab4736bebbda51263c79950c8df6236ed4fa34 | |
| parent | 223c62a9746d01f5987a3debfe14c67b0e4ff794 (diff) | |
| download | pffft-305fa3435324e8f7ff8cf426f1b5c6a2c79e41f8.tar.gz | |
added some links in README
* added link to Julien Pommier's pffft on bitbucket
* added link to "Free small FFT in multiple languages" of Project Nayuki
Signed-off-by: hayati ayguen <h_ayguen@web.de>
| -rw-r--r-- | README.md | 10 |
1 files changed, 10 insertions, 0 deletions
@@ -98,6 +98,11 @@ and `libPFFASTCONV.a` from the source files, plus the additional `libFFTPACK.a` library. Later one's sources are there anyway for the benchmark. +## Origin: +Origin for this code is Julien Pommier's pffft on bitbucket: +[https://bitbucket.org/jpommier/pffft/](https://bitbucket.org/jpommier/pffft/) + + ## Comparison with other FFTs: The idea was not to break speed records, but to get a decently fast @@ -114,6 +119,11 @@ It is also a bit focused on performing 1D convolutions, that is why it provides "unordered" FFTs , and a fourier domain convolution operation. +Very interesting is [https://www.nayuki.io/page/free-small-fft-in-multiple-languages](https://www.nayuki.io/page/free-small-fft-in-multiple-languages). +It shows how small an FFT can be - including the Bluestein algorithm, but it's everything else than fast. +The whole C++ implementation file is 161 lines, including the Copyright header, see +[https://github.com/nayuki/Nayuki-web-published-code/blob/master/free-small-fft-in-multiple-languages/FftComplex.cpp](https://github.com/nayuki/Nayuki-web-published-code/blob/master/free-small-fft-in-multiple-languages/FftComplex.cpp) + ## Benchmark results |