Unscrambling for fast DFT algorithms

Several methods are reviewed for removing the unscrambler in the prime factor algorithms (PFA) and the types of unscrambler necessary for the Cooley-Tukey FFT (fast Fourier transform) are discussed. It is shown that a radix-4, radix-8, radix-16, or any radix-2/sup m/ FFT can be written to give the output in the same bit-reversed order as the radix-2 FFT. This applies to programs which mix radix-8, radix-4, and radix-2 stages to have the high efficiency of radix-8 and radix-4 and the variety of lengths of radix-2. In a more general form, the method will allow a radix-16 to give its output in the same order as as radix-4 FFT. The method can be used with radix-2/sup m/ Harley, cosine, sine, number-theoretic, and special real-data transforms. This result has practical importance because it allows a single software or hardware bit-reverse counter to unscramble the more efficient radix-4, radix-8, and mixed-radix FFTs. >

[1]  C. Sidney Burrus,et al.  On the structure of efficient DFT algorithms , 1985, IEEE Trans. Acoust. Speech Signal Process..

[2]  C. Sidney Burrus,et al.  On computing the split-radix FFT , 1986, IEEE Trans. Acoust. Speech Signal Process..

[3]  Joseph H. Rothweiler.  Implementation of the in-order prime factor transform for variable sizes , 1982 .

[4]  David M. W. Evans.  An improved digit-reversal permutation algorithm for the fast Fourier and Hartley transforms , 1987, IEEE Trans. Acoust. Speech Signal Process..

[5]  Douglas L. Jones,et al.  On computing the discrete Hartley transform , 1985, IEEE Trans. Acoust. Speech Signal Process..

[6]  P. Duhamel,et al.  `Split radix' FFT algorithm , 1984 .

[7]  C. Loeffler,et al.  Searching for the best Cooley-Tukey FFT algorithms , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[8]  C. Sidney Burrus,et al.  An in-order, in-place radix-2 FFT , 1984, ICASSP.

[9]  C. Burrus,et al.  An in-place, in-order prime factor FFT algorithm , 1981 .

[10]  C. Burrus.  Index mappings for multidimensional formulation of the DFT and convolution , 1977 .