Improved twiddle access for fast Fourier transforms

IEEE Transactions on Signal Processing

Volumn 58, Issue 3 PART 1, 2010, Pages 1122-1130

  Bowers, Kevin J ^a   Lippert, Ross A ^a   Dror, Ron O ^a   Shaw, David E ^a,b  

^a D E SHAW RESEARCH   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Algorithms; Discrete Fourier transforms; Memory management

Indexed keywords

ARITHMETIC OPERATIONS; COMMODITY HARDWARE; COOLEY-TUKEY; DECIMATION IN FREQUENCIES; DEPTH FIRST; FAST FOURIER TRANSFORM ALGORITHM; FFT ALGORITHM; MEMORY MANAGEMENT; MODERN PROCESSORS; OPTIMIZATION TECHNIQUES; OPTIMIZED IMPLEMENTATION; PERFORMANCE IMPROVEMENTS; RECURSIONS; TRANSFORM ORDER; TWIDDLE FACTOR; VECTORIZATION;

ALGORITHMS; OPTIMIZATION; SIGNAL RECEIVERS;

DISCRETE FOURIER TRANSFORMS;

EID: 78650927757     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2009.2035984     Document Type: Article

References (14)

1. J. W. Cooley and J. W. Tukey, "An algorithm for the machine computation of complex Fourier series," Math. Comput., vol. 19, pp. 297-301, 1965.
2. E. O. Brigham, The Fast Fourier Transform. Englewood Cliffs, NJ: Prentice-Hall, 1974.
3. M. Frigo and S. G. Johnson, The Fastest Fourier Transform in theWest Mass. Inst. Technol., Cambridge, Tech. Rep. MIT-LCS-TR-728, 1997.
4. M. Frigo and S. G. Johnson, "The design and implementation of FFTW3," Proc. IEEE, vol. 93, no. 2, pp. 216-231, 2005. (Pubitemid 40851223)
5. S. Bouguezel, M. O. Ahmad, and M. N. S. Swamy, "Improved radix-4 and radix-8 FFT algorithms," in Proc. ISCAS'04: IEEE Int. Symp. Circuits Syst., 2004, vol. 3, pp. 561-564.
6. S. G. Johnson, "Modified Cooley-Tukey algorithms based on a generalized DFT framework," Pers. Commun. pp. 1-3, 2008 [Online]. Available:http://math.mit.edu/~stevenj/gdft.pdf
7. C. M. Fiduccia, "Polynomial evaluation via the division algorithm the fast Fourier transform revisited," in Proc. 4th Ann. ACM Symp. Theory Computing (STOC'72), New York, 1972, pp. 88-93, ACM.
8. Y. Voronenko and M. Püschel, "Algebraic signal processing theory: Cooley-Tukey type algorithms for real DFTs," IEEE Trans. Signal Process., vol. 57, no. 1, 2009.
9. Y. Jiang, T. Zhou, Y. Tang, and Y. Wang, "Twiddle-factor-based FFT algorithm with reduced memory access," in Proc. 16th Int. Parallel Distrib. Process. Symp. (IPDPS'02), Washington, DC, 2002, p. 326, IEEE Comput. Soc.
10. P. Duhamel and M. Vetterli, "Fast Fourier transforms: A tutorial review and a state of the art," Signal Process., vol. 19, no. 4, pp. 259-299, 1990. (Pubitemid 20684988)
11. S. Winograd, "On computing the discrete Fourier transform," in Proc. Nat. Acad. Sci., 1976, vol. 73, no. 4, pp. 1005-1006.
12. S.Winograd, "On computing the DFT," Math. Comput., vol. 32, no. 1, pp. 175-199, 1978.
13. G. Goertzel, "An algorithm for the evaluation of finite trigonometric series," Amer. Math. Monthly, vol. 65, no. 1, pp. 34-35, 1958.
14. K. J. Bowers, E. Chow, H. Xu, R. O. Dror, M. P. Eastwood, B. A. Gregersen, J. L. Klepeis, I. Kolossváry, M. A. Moraes, F. D. Sacerdoti, J. K. Salmon, Y. Shan, and D. E. Shaw, "Scalable algorithms for molecular dynamics simulations on commodity clusters," in Proc. 2006 ACM/IEEE Conf. Supercomput. (SCO6), New York, 2006, ACM.