Sorry I misunderstood you. The code looks to me like it's rounding UP to the
nearest power of 2; this would probably assume the arrays are padded with
zeros. So perhaps you could USE a non power of 2 array, but the opcode would
COMPUTE a power of 2 elements. Can somebody tell us if this is right?
-----Original Message-----
From: Niels Gorisse [mailto:niels@bonneville.nl]
Sent: Wednesday, December 01, 1999 8:18 AM
To: Michael Gogins; saol-dev@media.mit.edu
Subject: RE: fft/ifft
Hi,
>Both sides of the tables are used, and the size must indeed be a power of
2.
>The FFT is the "Fast" Fourier Transform because it uses a "butterfly"
I know what FFT is and how FFT works (even mathematically!), but my
question is weither it should be póssible to use an other size than a power
of two (since there is nothing said about it in the manual and it is even
half-supported in the reference implementation).
Niels Gorisse
This archive was generated by hypermail 2b29 : Wed May 10 2000 - 12:15:49 EDT