Skip to Main Content
This paper presents an efficient Fortran program that computes the Duhamel-Hollmann split-radix FFT. An indexing scheme is used that gives a three-loop structure for the split-radix FFT that is very similar to the conventional Cooley-Tukey FFT. Both a decimation-in-frequency and a decimation-in-time program are presented. An arithmetic analysis is made to compare the operation count of the Cooley-Tukey FFT fo several different radixes to that of the split-radix FFT. The split-radix FFT seems to require the least total arithmetic of any power-of-two DFT algorithm.