Automatic generation of prime length FFT programs

Describes a set of programs for circular convolution and prime length fast Fourier transforms (FFTs) that are relatively short, possess great structure, share many computational procedures, and cover a large variety of lengths. The programs make clear the structure of the algorithms and clearly enumerate independent computational branches that can be performed in parallel. Moreover, each of these independent operations is made up of a sequence of suboperations that can be implemented as vector/parallel operations. This is in contrast with previously existing programs for prime length FFTs: They consist of straight line code, no code is shared between them, and they cannot be easily adapted for vector/parallel implementations. The authors have also developed a program that automatically generates these programs for prime length FTTs. This code-generating program requires information only about a set of modules for computing cyclotomic convolutions.

[1]  C S. Burrus.  Efficient Fourier transform and convolution algorithms , 1987 .

[2]  Chao Lu,et al.  FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000 , 1993, IEEE Trans. Signal Process..

[3]  R. Tolimieri,et al.  Algorithms for Discrete Fourier Transform and Convolution , 1989 .

[4]  H. Nussbaumer,et al.  Fast polynomial transform algorithms for digital convolution , 1980 .

[5]  S. Winograd.  Arithmetic complexity of computations , 1980 .

[6]  K. J. Jones.  Prime number DFT computation via parallel circular convolvers , 1990 .

[7]  J. Cooley,et al.  New algorithms for digital convolution , 1977 .

[8]  C. Rader.  Discrete Fourier transforms when the number of data samples is prime , 1968 .

[9]  C. Sidney Burrus,et al.  The design of optimal DFT algorithms using dynamic programming , 1982, ICASSP.

[10]  C. S. Burrus,et al.  Automating the design of prime length FFT programs , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

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

[12]  R. Stasinski.  Easy generation of small-Ndiscrete Fourier transform algorithms , 1986 .

[13]  H. Nussbaumer.  Fast Fourier transform and convolution algorithms , 1981 .

[14]  R. Tolimieri,et al.  The tensor product: a mathematical programming language for FFTs and other fast DSP operations , 1992, IEEE Signal Processing Magazine.

[15]  Clive Temperton.  Implementation of a self-sorting in-place prime factor FFT algorithm , 1985 .

[16]  C. Sidney Burrus,et al.  Multidimensional mapping techniques for convolution , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[17]  Michael T. Heideman,et al.  Computation of an odd-length DCT from a real-valued DFT of the same length , 1992, IEEE Trans. Signal Process..

[18]  Yechezkel Zalcstein,et al.  A Note on Fast Cyclic Convolution , 1971, IEEE Transactions on Computers.

[19]  Allan O. Steinhardt,et al.  Fast algorithms for digital signal processing , 1986, Proceedings of the IEEE.

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

[21]  C. Sidney Burrus,et al.  Extending Winograd's small convolution algorithm to longer lengths , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[22]  D. Myers.  Digital Signal ProcessingEfficient Convolution and Fourier Transform Techniques , 1990 .