Re: fftSize requirement for RealtimeAnalyserNode

On Fri, Mar 23, 2012 at 1:18 PM, Chuck Adams <cadams@fender.com> wrote:

> Power of two isn’t an arbitrary limit in the FFT, it’s a fundamental piece
> of what makes it the Fast Fourier Transform.     If you want an arbitrary
> number then you can’t use the  FFT algorithm, you need the discrete Fourier
> transform or the like.****
>
> **
>

No, there are fast algorithms that are still O(n*log(n)) for lengths that
are not a power of two.  See, among others, www.fftw.org.

Ray