From 305fa3435324e8f7ff8cf426f1b5c6a2c79e41f8 Mon Sep 17 00:00:00 2001 From: hayati ayguen Date: Sat, 13 Jun 2020 11:49:42 +0200 Subject: 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 --- README.md | 10 ++++++++++ 1 file changed, 10 insertions(+) (limited to 'README.md') diff --git a/README.md b/README.md index 27dd530..db318a0 100644 --- a/README.md +++ b/README.md @@ -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 -- cgit v1.2.3