A Simple Implementation of Dynamical Memory Allocation in Old-fashioned Singleton’s Mixed-radix Fast Fourier Transformation Code

We propose a simple prescription for resolving the general-N problem existing in the old-fashioned mixed-radix fast Fourier transformation FORTRAN subroutine by Singleton in 1968. After a brief investigation on the problem, we discuss our prescription with the worst case analysis within the dynamical allocation. The analysis reveals that our implementation is superior, at least for multi-variate data set, than previously proposed data copying methods