Automatic generation of prime length FFT programs

IEEE Transactions on Signal Processing

Volumn 44, Issue 1, 1996, Pages 14-24

  Selesnick, Ivan W ^b   Burrus, C Sidney ^a,b  

^a IEEE

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONVOLUTIONAL CODES; FAST FOURIER TRANSFORMS; PARALLEL PROCESSING SYSTEMS;

AUTOMATIC CODE GENERATION; CODE GENERATING PROGRAM; CYCLOTOMIC CONVOLUTIONS; STRAIGHT LINE CODE; VECTOR PARALLEL OPERATIONS;

COMPUTER SOFTWARE;

EID: 0029771732     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.482008     Document Type: Article

References (21)

1. R. C. Agarwal and J. W. Cooley, "New algorithms for digital convolution," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, no. 5, pp. 392-410, Oct. 1977.
2. R. E. Blahut, Fast Algorithms for Digital Signal Processing. Reading, MA: Addison-Wesley, 1985.
3. C. S. Burrus, "Efficient Fourier transform and convolution algorithms," in J. S. Lim and A. V. Oppenheim, Eds., Advanced Topics in Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1988.
4. C. S. Burrus and P. W. Eschenbacher. "An in-place, in-order prime factor FFT algorithm," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-29, no. 4, pp. 806-817, Aug. 1981.
5. J. Granata, M. Conner, and R. Tolimieri, "The Tensor product: A mathematical programming language for FFT's and other fast DSP operations," IEEE Signal Processing Mag., vol. 9, no. 1, pp. 40-48, Jan. 1992.
6. M. T. Heideman, "Computation of an odd-length DCT from a real-valued DFT of the same length," IEEE Trans. Signal Processing, vol. 40. no. 1, pp. 54-59, Jan. 1992.
7. H. W. Johnson and C. S. Burrus, "The design of optimal DFT algorithms using dynamic programming," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, no. 2, pp. 378-387, Apr. 1983.
8. _, "On the structure of efficient DFT algorithms," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, no. 1, pp. 248-254, Feb. 1985.
9. _, "Large DFT modules: 11, 13, 17, 19, 25," Tech. Rep. 8105, Rice Univ., 1981.
10. K. J. Jones, "Prime number DFT computation via parallel circular convolvers," Proc. Inst. Elec. Eng., Part F, vol. 137, no. 3, pp. 205-212, June 1990.
11. C. Lu, J. W. Cooley, and R. Tolimieri. "FFT algorithms for prime transform sizes and their implementations of VAX, IBM3090VF, and IBM RS/6000," IEEE Trans. Acoust., Speech, Signal Processing, vol. 41. no. 2, pp. 638-648, Feb. 1993.
12. D. G. Myers, Digital Signal Processing: Efficient Convolution and Fourier Transform Techniques. Englewood Cliffs, NJ: Prentice-Hall, 1990.
13. H. J. Nussbaumer, "Fast polynomial transform algorithms for digital convolution," IEEE Trans. Acoust., Speech, Signal Processing, vol. 28, no. 2, pp. 205-215, Apr. 1980.
14. _, Fast Fourier Transform and Convolution Algorithms. New York: Springer-Verlag, 1982.
15. C. M. Rader, "Discrete Fourier transform when the number of data samples is prime," Proc. IEEE, vol. 56, no. 6, pp. 1107-1108, June 1968.
16. I. W. Selesnick and C. S. Burrus. "Automating the design of prime length FFT programs," in Proc. IEEE Int. Symp. Circuits Syst., vol. 1, pp. 133-136, 1992.
17. R. Slasinski, "Easy generation of small-n discrete Fourier transform algorithms," Proc. Inst. Elec. Eng. Part G, vol. 133, no. 3, pp. 133-139, June 1986.
18. C. Temperton, "Implementation of a self-sorting in-place prime factor FFT algorithm," J. Comput. Phys., vol. 58, pp. 283-299, 1985.
19. R. Tolimieri, M. An, and C. Lu, Algorithms for Discrete Fourier Transform and Convolution. New York: Springer-Verlag, 1989.
20. S. Winograd, Arithmetic Complexity of Computations. Philadelphia: SIAM, 1980.
21. Y. Zalcstein, "A note on fast cyclic convolution," IEEE Trans. Comput., vol. 20, pp. 665-666, June 1971.