FFT documentation

[Roberto Hernández]

The FFT algorithm was designed for signals with a number of samples that is
an integer power of two. In case the number of samples isn't a power of two
there are two options: 1. zero-pad or truncate the signal, 2. use the DFT
algorithm which is much slower, but works for any number of samples.

I havent found any mention in the FFT function documentation as to which
approach is taken in this case. Does anyone know?

Roberto Hernandez
address@hidden




-------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.

Octave's home on the web:  http://www.octave.org
How to fund new projects:  http://www.octave.org/funding.html
Subscription information:  http://www.octave.org/archive.html
-------------------------------------------------------------