1 FOURIER Compute the complex Fourier transform of a real spectra cube
FOURIER
This task computes the complex Fourier transform of a real spectra cube.
The algorithm is faster if the number of pixels are powers of two but
this is not mandatory.
2 NAME_IN$
TASK\FILE "Input lmv cube" NAME_IN$
The name of the input file name. This can be a 2D image or a 3D cube.
2 NAME_OUT$
TASK\FILE "Output Fourier transform cube" NAME_OUT$
The name of the output file name. It will be 3D or 4D with the first di-
mension equal to 2, and corresponding to the REAL-IMAGINARY axis.
2 SIGN$
TASK\INTEGER "Direct (+1) or inverse (-1) transform" SIGN$
+1 for direct transform, -1 for inverse transform.
2 REORDER$
TASK\LOGICAL "Do you want to reorder the Fourier transform?" RE-
ORDER$
The FFT algorithm orders the Fourier transform in an awkward way. If RE-
ORDER$ is set to YES, the task will reorder the data in the intuitive
way.
1 ENDOFHELP