Programs in Physics & Physical Chemistry
|[Licence| Download | New Version Template] abfb_v1_0.gz(7 Kbytes)|
|Manuscript Title: Two dimensional fast Fourier transform for large data matrices.|
|Authors: M.H. Serzu, W.M. Moon|
|Program title: SW2DFFT|
|Catalogue identifier: ABFB_v1_0|
Distribution format: gz
|Journal reference: Comput. Phys. Commun. 52(1989)333|
|Programming language: Fortran.|
|Computer: AMDAHL 5870.|
|Operating system: 370 MVS3.|
|RAM: 368K words|
|Word size: 8|
|Keywords: Fast Fourier transform, Inplace computation, Stepwise computation, 2-D FFT, Rectangular data matrix, General purpose, Fourier.|
Nature of problem:
Any problem that requires Fourier Transformation of a large 2-D data matrix.
The Discrete Fourier Transform (DFT) is computed using the decomposed Cooley-Tukey algorithm for Fast Fourier Transform. The algorithm is implemented with decimation in time. The program avoids calling the complex function CMPLX and the Fast Fourier Transform is performed in two stages; A and B.
The dimensions of the data matrix to be transformed have to be powers of 2. The data must reside in a direct access mass storage for efficient use of core memory.
For 256 by 256 data matrix Stepwise FFT(SW2DFFT): 33.90 sec Usual FFT,,pp. 177: 25.32 sec
|Disclaimer | ScienceDirect | CPC Journal | CPC | QUB|