A Prime Factor FFT Algorithm Using Hiqh-Speed Convolution

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 25, Issue 4, 1977, Pages 281-294

  Kolba, Dean P ^a   Parks, Thomas W ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - SUBROUTINES;

MATHEMATICAL TRANSFORMATIONS;

COMPUTER ANALYSIS; FOURIER TRANSFORMATION; THEORETICAL STUDY;

EID: 0017626205     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1977.1162973     Document Type: Article

References (15)

1. J. W. Cooley and J. W. Tukey, “An algorithm for the machine calculation of complex Fourier series,” Math. Comput., vol. 19, pp. 297–301, Apr. 1965.
2. C. M. Rader, “Discrete Fourier transforms when the number of data samples is prime,” Proc. IEEE, vol. 56, pp. 1107–1108, June 1968.
3. S. Winograd, “Some bilinear forms whose multiplicative complexity depends on the field of constants,” IBM T. J. Watson Res. Ctr., Yorktown Heights, NY, IBM Res. Rep., RC 5669, Oct. 10, 1975.
4. R. Agarwal and J. W. Cooley, “New algorithms for digital convolution,” presented at the IEEE Arden House Workshop, Feb. 1976; also to appear in this Transactions.
5. S. Winograd, “On computing the discrete Fourier transform,” phoc. Nat. Acad. Sci. USA, vol. 73, no. 4, pp. 1005–1006, Apr. 1976.
6. I. J. Good, “The interaction algorithm and practical Fourier analysis,” J. Royal Statist. Soc., ser. B, vol. 20, pp. 361–372, 1958; “Addendum,” vol. 22 (MR 21 1674; MR 23 A4231), pp. 372–375, 1960.
7. L. H. Thomas, “Using a computer to solve problems in physics,” in Applications of Digital Computers. Boston, MA: Ginn and Co., 1963.
8. C. D. Mostow, J. H. Sampson, and J. Meyer, Fundamental Structures of Algebra. New York: McGraw-Hill, 1963.
9. J. McClellan and C. M. Rader, “There is something much faster than the fast Fourier transform,” Seminar Notes, Oct. 21, 1976.
10. H. F. Silverman, “An introduction to programming the Winograd Fourier transform algorithm (WFTA),“ IEEE Trans. Acoust., Speech, Signal Processing, vol ASSP-25, pp. 152–165, Apr. 1977.
11. C. S. Burrus, “Index mappings for multidimensional formulation of the DFT and convolution,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 239–242, June 1977.
12. D. E. Knuth, “Seminumerical algorithms,” in The Art of Computer Programming, vol. 2. Reading, MA: Addison-Wesley, 1971.
13. B. Gold and C. M. Rader, Digital Processing of Signals. New York: McGraw-Hill, 1969, p. 194.
14. L. R. Rabiner and B. Gold, Theory and Application of Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
15. R. C. Singleton, “An algorithm for computing the mixed radix fast Fourier transform,” IEEE Trans. Audio Electroacoust., vol. AU-17, pp. 93–103, June 1969.