I'm going to hazard a guess, that the dft() algorithm takes a big chunk of
the CPU.
It's nice because it doesn't have to be a power of 2, and works with the
2-dimensions.
For the DFT it takes 144 complex time samples and produces 19 complex
frequency samples.
The IDFT the opposite.
That's 144 x 19 = 2736 complex multiplications and additions each time it
is called.
KISS FFT is not a good candidate. FFTW probably is.
Steve
On Wed, May 2, 2018 at 4:18 AM, Alan Beard <bear...@unixservice.com.au>
wrote:
>
>
> 700D is a bit CPU hungry:
>
------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________
Freetel-codec2 mailing list
Freetel-codec2@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/freetel-codec2
