Two dimensional fast Fourier transform for large data matrices. 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 decomposed Cooley-Tukey algorithm. The number of arithmetic operations are exactly the same as in the Cooley-Tukey method.
References in zbMATH (referenced in 1 article )
Showing result 1 of 1.
- Serzu, Mulugeta H.; Moon, Wooil M.: Two dimensional fast Fourier transform for large data matrices (1989)