Real-Valued Fast Fourier Transform Algorithms

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 35, Issue 6, 1987, Pages 849-863

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

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TRANSFORMATIONS - FAST FOURIER TRANSFORMS;

DIGITAL SIGNAL PROCESSING; REAL-VALUED FFT ALGORITHMS;

SIGNAL PROCESSING;

EID: 0023364252     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1987.1165220     Document Type: Note

References (41)

1. G.D. Bergland, “A fast Fourier transform algorithm for real-valued series,” Commun. ACM, vol. 11, no. 10, pp. 703–710, Oct. 1968.
2. G.D. Bergland,”A radix-eight fast Fourier transform subroutine for real-valued Series,” IEEE Trans. Audio Electroacoust., vol. AU-17, pp. 138–144, June 1969.
3. R.N. Bracewell, “The fast Hartley transform,” Proc. IEEE, vol. 72, pp. 1832–1835, Dec. 1983.
4. R.N. Bracewell, The Hartley Transform. New York: Oxford Univ. Press, 1986.
5. E.O. Brigham, The East Fourier Transform. Englewood Cliffs, NJ: Prentice-Hall, 1974.
6. 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.
7. 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.
8. C.S. Burrus and T.W. Parks, DFT/FFT and Convolution Algorithms. New York: Wiley, 1985,.
9. W.H. Chen and S.C. Fralick, “Image enhancement using cosine transform filtering,” in Proc. Symp. Image Science Mathematics, Monterey, CA, Nov. 10-12, 1976, pp. 186–192.
10. J.W. Cooley, P.A.W. Lewis, and P.D. Welch, “The finite Fourier transform,” IEEE Trans. Audio Electroacoust., vol. AU-17, pp. 77-85, June 1969; reprinted in L.R. Rabiner and C.M. Rader, Eds., Digital Signal Processing. New York: IEEE Press, 1972, pp. 251–259.
11. J.W. Cooley, “The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine, and Laplace transforms,” J. Sound Vib., vol. 12, no. 3, pp. 315-337, July 1970; reprinted in L.R. Rabiner and C.M. Rader, Eds., Digital Signal Processing. New York: IEEE Press, 1972, pp. 271–293.
12. E. Dubois and A. Venetsanopoulos, “A new algorithm for the radix-3 FFT,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-26, pp. 222–225, June 1978.
13. P. Duhamel and H. Hollmann, “Split radix' FFT algorithm,” Electron. Lett., vol. 20, no. 1, pp. 14–16, Jan. 5, 1984.
14. P. Duhamel, “A 'split-radix' fast Fourier transform,” Ann. Télécommun. (in French), vol. 40, no. 9-10, pp. 418–494, Sept.-Oct. 1985.
15. P. Duhamel, “Implementation of 'split radix' FFT algorithms for complex, real and real-symmetric data,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 285–295, Apr. 1986.
16. P. Duhamel and M. Vetterli, “Cyclic convolution of real sequences: Hartley versus Fourier and new schemes,” in Proc. 1986 IEEE Int. Conf. Acoust., Speech, Signal Processing, Tokyo, Japan, Apr. 8-11, 1986, pp. 6.5.1–6.5.4.
17. M.T. Heideman, C.S. Burrus, and H.W. Johnson, “Prime factor FFT algorithms for real-valued series,” in Proc. 1984 IEEE Int. Conf. Acoust., Speech, Signal Processing, San Diego, CA, Mar. 19-21, 1984, pp. 28A.7.1–28A.7.4.
18. D.P. Kolba and T.W. Parks, “A prime factor FFT algorithm using high speed convolution,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 281–294, Aug. 1977.
19. R. Kumaresan and P.K. Gupta, “A prime factor FFT algorithm with real valued arithmetic,” Proc. IEEE, vol. 73, pp. 1241–1243, July 1985.
20. B.G. Lee, “A new algorithm to compute the discrete cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 1243–1245, Dec. 1984.
21. J.B. Martens, “Discrete Fourier transform algorithms for real valued sequences,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 390–396, Apr. 1984.
22. 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.
23. J.H. McClellan and C.M. Rader, Number Theory in Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1979.
24. H.J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms. New York: Springer-Verlag, 1982.
25. A.V. Oppenheim and R.W. Schafer, Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
26. T.W. Parsons, “A Winograd-Fourier transform algorithm for real-valued data,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, pp. 398–402, Aug. 1979.
27. S. Prakash and V.V. Rao, “A new radix-6 FFT algorithm,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-29, pp. 939–941, Aug. 1981.
28. R.D. Preuss, “Very fast computation of the radix-2 discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30, pp. 595–607, Aug. 1982.
29. L.R. Rabiner and B. Gold, Theory and Application of Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
30. L.R. Rabiner, “On the use of symmetry in FFT computations,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, pp. 233–239, June 1979.
31. G. Sande, “Fast Fourier transform-A globally complex algorithm with locally real implementations,” in Proc. 4th Annu. Princeton Conf. Inform. Sci. Syst., Princeton, NJ, Mar. 26-27, 1970, pp. 136–142.
32. R.C. Singleton, “On computing the fast Fourier transform,” Commun. ACM, vol. 10, no. 10, pp. 647–654; Oct. 1967.
33. IEEE Acoust., Speech, Signal Processing Society, Programs for Digital Signal Processing. New York: IEEE Press, 1979.
34. 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.
35. H.V. Sorensen, D.L. Jones, M.T. Heideman, and C.S. Burrus, “A split-radix real-valued fast Fourier transform,” in Proc. 3rd Eur. Signal Processing Conf, The Hague, The Netherlands, Sept. 2-5, 1986, pp. 287–290.
36. H.V. Sorensen, M.T. Heideman, and C.S. Burrus, “On computing the split-radix FFT,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 152–156, Feb. 1986.
37. Y. Suzuki, T. Sone, and K. Kido, “A new FFT algorithm of radix 3, 6, and 12,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 380–383, Apr. 1986.
38. M. Vetterli and H.J. Nussbaumer, “Simple FFT and DCT algorithms with reduced number of operations,” Signal Processing, vol. 6, no. 4, pp. 267–278, Aug. 1984.
39. S. Winograd, “On computing the discrete Fourier transform,” Math. Comput., vol. 32, no. 141, pp. 175–199, Jan. 1978.
40. R. Yavne, “An economical method for calculating the discrete Fourier transform, Fall Joint Comput. Conf. AFIPS Conf. Proc., vol. 33, p. 1, Spartan, Washington, DC, 1968, pp. 115–125.
41. H. Ziegler, “A fast Fourier transform algorithm for symmetric real-valued series,” IEEE Trans. Audio Electroacoust., vol. AU-20, pp. 353–356, Dec. 1972.