Two dimensional fast Fourier transform for large data matrices

Published: 1 January 1989| Version 1 | DOI: 10.17632/wvcvxk7ykn.1
Mulugeta H. Serzu, Wooil M. Moon


Abstract Most of the commonly used fast Fourier transform subroutines can not handle large data matrices because of the restriction imposed by the system's core memory. In this paper we present a two dimensional FFT program (SW2DFFT) and its long write-up. SW2DFFT is a Fortran program capable of handling large data matrices both square and rectangular. The data matrix is stored externally in a direct access mass storage. The program uses a stepwise approach in computing the large matrices based on the... Title of program: SW2DFFT Catalogue Id: ABFB_v1_0 Nature of problem Any problem that requires Fourier Transformation of a large 2-D data matrix. Versions of this program held in the CPC repository in Mendeley Data ABFB_v1_0; SW2DFFT; 10.1016/0010-4655(89)90108-2 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)



Computational Physics, Computational Method