On Computing the Split-Radix FFT

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 34, Issue 1, 1986, Pages 152-156

  Sorensen, Henrik V ^a   Heideman, Michael T ^a   Burrus, C Sidney ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES - FORTRAN;

DECIMATION-IN-FREQUENCY PROGRAM; DECIMATION-IN-TIME PROGRAM; SPLIT RADIX FFT COMPUTATION;

MATHEMATICAL TRANSFORMATIONS;

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

References (21)

1. M. T. Heideman, D. H. Johnson, and C. S. Burrus, “Gauss and the history of the FFT,” IEEE Acoust., Speech, Signal Processing Mag., vol. 1, pp. 14–21, Oct. 1984.
2. 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.
3. L. R. Rabiner and C. M. Rader, Eds., Digital Signal Processing, Selected Reprints. New York: IEEE Press, 1972.
4. R. Yavne, “An economical method for calculating the discrete Fourier transform,” in Proc. Fall Joint Comput. Conf., 1968, pp. 115–125.
5. S. Winograd, “On computing the discrete Fourier transform,” Math. Comput., vol. 32, pp. 175–199, 1978.
6. —, “On the multiplicative complexity of the discrete Fourier transform,” Adv. Math., vol. 32, pp. 83–117, May 1979.
7. —, Arithmetic Complexity of Computation, SIAM CBMS-NSF Series, no. 33. Philadelphia PA: SIAM, 1980.
8. M. T. Heideman and C.S. Burrus, “Multiply/add tradeoffs in length-2n FFT algorithms,” in Proc. IEEE Int. Conf. ASSP, Tampa, FL, Apr. 1985.
9. —, “On the number of multiplications necessary to compute a length-2 n DFT,” IEEE Trans. Acoust., Speech, Signal Processing, pp. 91–95, this issue.
10. P. Duhamel and H. Hollmann, “Existence of a 2” FFT algorithm with a number of multiplications lower than 2 n + 1,” Electron. Lett., vol. 20, pp. 690–692, Aug. 16, 1984.
11. —, “Split radix FFT algorithm,” Electron. Lett., vol. 20, pp. 14–16, Jan. 5, 1984.
12. P. Duhamel, “Implementation of ‘split-radix’ FFT algorithms for complex, real, and real-symmetric data,” IEEE Trans. Acoust., Speech, Signal Processing, to appear.
13. J. B. Martens, “Recursive cyclotomic factorization—A new algorithm for calculating the discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 750–761, Aug. 1984.
14. M. Vetterli and H. J. Nussbaumer, “Simple FFT and DCT algorithms with reduced number of operations,” Signal Processing, vol. 6, pp. 267–278, Aug. 1984.
15. C. S. Burrus and T. W. Parks, DFT/FFT and Convolution Algorithms. New York: Wiley, 1984.
16. A. V. Oppenheim and R. W. Schafer, Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
17. L. R. Rabiner and B. Gold, Theory and Application of Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
18. H. W. Johnson and C. S. Burrus, “Twiddle factors in the radix-2 FFT,” in Proc. 1982 Asilomar Conf. Circuits, Syst., Comput., Nov. 1982, pp. 413–416.
19. 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, pp. 806–817, Aug. 1981.
20. L. R. Morris, Digital Signal Processing Software. Ottawa, Canada: DSPS Inc., 1982, 1983.
21. H. V. Sorensen, D. L. Jones, C. S. Burrus, and M. T. Heideman, “On computing the discrete Hartley transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, pp. 1231–1238, Oct. 1985.