FFT2 Question

[Sukanta Basu]

Hi,

I am comparing fft2 execution speed in Matlab vs. Octave.

If x = randn(N) [say N = 128, 256 etc.], fx = fft2(x) calculation on
Octave is ~2.5-3 times faster than Matlab [test on three different
platforms running Ubuntu 12.04].

However, if x = randn(N,N,N), fx = fft2(x) calculation on Octave is
~2-2.5 times slower than Matlab. The performance on Octave improves
slightly if one uses: fx = zeros(size(x)); for k = 1:N; fx(:,:,k) =
fft2(x(:,:,k)); end;

Is there any way, I can enhance the speed of Octave for fft2 execution
for three-dimensional arrays?

Thanks,
Sukanta

-- 
Sukanta Basu
Associate Professor
North Carolina State University
http://www4.ncsu.edu/~sbasu5/