The design and implementation of FFTW3

Proceedings of the IEEE

Volumn 93, Issue 2, 2005, Pages 216-231

  Frigo, Matteo ^a   Johnson, Steven G ^b  

^a IBM AUSTIN RESEARCH LABORATORY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Adaptive software; Cosine transform; Fast Fourier transform (FFT); Fourier transform; Hartley transform; I O tensor

Indexed keywords

ALGORITHMS; CODES (STANDARDS); COMPUTER ARCHITECTURE; COMPUTER SOFTWARE; COSINE TRANSFORMS; DATA STRUCTURES; DISCRETE FOURIER TRANSFORMS; OPTIMIZATION; PROBLEM SOLVING;

ADAPTIVE SOFTWARE; HARTLEY TRANSFORM; I/O TENSORS; SINGLE-INTRUSION, MULTIPLE DATA (SIMD) INSTRUCTION;

FAST FOURIER TRANSFORMS;

EID: 20744449792     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2004.840301     Document Type: Conference Paper

References (60)

1. M. Frigo and S. G. Johnson. (2004) FFTW Web page. [Online]. Available: http://www.fftw.org/
2. M. Frigo, "A fast Fourier transform compiler," in Proc. ACM SIGPLAN'99 Conf. Programming Language Design and Implementation (PLDI), vol. 34, 1999, pp. 169-180.
3. M. Frigo and S. G. Johnson, "FFTW: An adaptive software architecture for the FFT," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, vol. 3, 1998, pp. 1381-1384.
4. G. Jayasumana, "Searching for the best Cooley-Tukey FFT algorithms," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, vol. 4, 1987, pp. 2408-2411.
5. H. Massalin, "Superoptimizer: A look at the smallest program," in Proc. 2nd Int. Conf. Architectural Support for Programming Languages and Operating System (ASPLOS), 1987, pp. 122-127.
6. J. Bilmes, K. Asanović, C.-W. Chin, and J. Demmel, "Optimizing matrix multiply using PHiPAC: A portable, high-performance, ANSI C coding methodology," presented at the Int. Conf. Supercomputing, Vienna, Austria, 1997.
7. R. Whaley and J. Dongarra, "Automatically Tuned Linear Algebra Software," Comput. Sci. Dept., Univ. Tennessee, Knoxville, Tech. Rep. CS-97-366, 1997.
8. S. K. S. Gupta, C. Huang, P. Sadayappan, and R. W. Johnson, "A framework for generating distributed-memory parallel programs for block recursive algorithms," J. Parallel Distrib. Comput., vol. 34, no. 2, pp. 137-153, May 1996.
9. M. Püschel, B. Singer, J. Xiong, J. M. F. Moura, J. Johnson, D. Padua, M. M. Veloso, and R. W. Johnson, "SPIRAL: A generator for platform-adapted libraries of signal processing algorithms," J. High Perform. Comput. Applicat., vol. 18, no. 1, pp. 21-45, 2004.
10. M. Püschel, J. M. F. Moura, J. Johnson, D. Padua, M. Veloso, B. W. Singer, J. Xiong, F. Franchetti, A. Gačić, Y. Voronenko, K. Chen, R. W. Johnson, and N. Rizzolo, "SPIRAL: Code generation for DSP transforms," Proc. IEEE, vol. 93, no. 2, pp. 232-275, Feb. 2005.
11. K. S. Gatlin, "Portable high performance programming via architecture-cognizant divide-and-conquer algorithms," Ph.D. dissertation, Univ. California, San Diego, 2000.
12. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
13. B. Singer and M. Veloso, "Learning to construct fast signal processing implementations," J. Mach. Learn. Res., vol. 3, pp. 887-919, 2002.
14. J. W. Cooley and J. W. Tukey, "An algorithm for the machine computation of the complex Fourier series," Math. Comput., vol. 19, pp. 297-301, Apr. 1965.
15. M. T. Heideman, D. H. Johnson, and C. S. Burrus, "Gauss and the history of the fast Fourier transform," IEEE ASSP Mag., vol. 1, no. 4, pp. 14-21, Oct. 1984.
16. P. Duhamel and M. Vetterli, "Fast Fourier transforms: A tutorial review and a state of the art," Signal Process., vol. 19, pp. 259-299, Apr. 1990.
17. C. van Loan, Computational Frameworks for the Fast Fourier Transform. Philadelphia, PA: SIAM, 1992.
18. D. H. Bailey, "FFT's in external or hierarchical memory," J. Supercomput., vol. 4, no. 1, pp. 23-35, May 1990.
19. R. C. Singleton, "On computing the fast Fourier transform," Commun. ACM, vol. 10, pp. 647-654, 1967.
20. A. H. Karp, "Bit reversal on uniprocessors," SIAM Rev., vol. 38, no. 1, pp. 1-26, 1996.
21. T. G. Stockham, "High speed convolution and correlation," in Proc. AFIPS Spring Joint Computer Conf., vol. 28, 1966, pp. 229-233.
22. P. N. Swarztrauber, "Vectorizing the FFTs," in Parallel Computations, G. Rodrigue, Ed. New York: Academic, 1982, pp. 51-83.
23. H. W. Johnson and C. S. Burrus, "An in-place in-order radix-2 FFT," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, 1984, pp. 28A.2.1-28A.2.4.
24. C. Temperton, "Self-sorting in-place fast Fourier transforms," SIAM J. Sci. Stat. Comput., vol. 12, no. 4, pp. 808-823, 1991.
25. Z. Qian, C. Lu, M. An, and R. Tolimieri, "Self-sorting in-place FFT algorithm with minimum working space," IEEE Trans. Acoust., Speech, Signal Process., vol. 42, no. 10, pp. 2835-2836, Oct. 1994.
26. M. Hegland, "A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing," Numerische Mathematik, vol. 68, no. 4, pp. 507-547, 1994.
27. A. V. Oppenheim, R. W. Schafer, and J. R. Buck, Discrete-Time Signal Processing, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 1999.
28. C. M. Rader, "Discrete Fourier transforms when the number of data samples is prime," Proc. IEEE, vol. 56, no. 6, pp. 1107-1108, Jun. 1968.
29. L. I. Bluestein, "A linear filtering approach to the computation of the discrete Fourier transform," in Northeast Electronics Research and Engineering Meeting Rec., vol. 10, 1968, pp. 218-219.
30. S. Winograd, "On computing the discrete Fourier transform," Math. Comput., vol. 32, no. 1, pp. 175-199, Jan. 1978.
31. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes in C: The Art of Scientific Computing, 2nd ed. New York: Cambridge Univ. Press, 1992.
32. R. C. Singleton, "An algorithm for computing the mixed radix fast Fourier transform," IEEE Trans. Audio Electroacoust., vol. AU-17, no. 2, pp. 93-103, Jun. 1969.
33. H. V. Sorensen, M. T. Heideman, and C. S. Burrus, "On computing the split-radix FFT," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-34, no. 1, pp. 152-156, Feb. 1986.
34. D. Takahashi, "A blocking algorithm for FFT on cache-based processors," in Lecture Notes in Computer Science, High-Performance Computing and Networking. Heidelberg, Germany: Springer-Verlag, 2001, vol. 2110, pp. 551-554.
35. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran, "Cache-oblivious algorithms," in Proc. 40th Ann. Symp. Foundations of Computer Science (FOCS '99), 1999, pp. 285-297.
36. M. Dow, "Transposing a matrix on a vector computer," Parallel Comput., vol. 21, no. 12, pp. 1997-2005, 1995.
37. E. G. Cate and D. W. Twigg, "Algorithm 513: Analysis of in-situ transposition," ACM Trans. Math. Softw. (TOMS), vol. 3, no. 1, pp. 104-110, 1977.
38. W. M. Gentleman and G. Sande, "Fast Fourier transforms - For fun and profit," in Proc. AFIPS Fall Joint Computer Conf., vol. 29, 1966, pp. 563-578.
39. K. Nakayama, "An improved fast Fourier transform algorithm using mixed frequency and time decimations," IEEE Trans. Acoust., Speech, Signal Process., vol. 36, no. 2, pp. 290-292, Feb. 1988.
40. A. Saidi, "Decimation-in-time-frequency FFT algorithm," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, vol. 3, 1994, pp. 453-456.
41. R. Rivest, "The MD5 message-digest algorithm," Network Working Group, Request for Comments (RFC) 1321, Apr. 1992.
42. P. T. P. Tang, "A comprehensive DFT API for scientific computing," in The Architecture of Scientific Software, ser. IFIP Conference Proceedings, R. F. Boisvert and P. T. P. Tang, Eds. Ottawa, ON, Canada: Kluwer, 2001, vol. 188, pp. 235-256.
43. J. Xiong, D. Padua, and J. Johnson, "SPL: A language and compiler for DSP algorithms," in Proc. ACM SIGPLAN'01 Conf. Programming Language Design and Implementation (PLDI), 2001, pp. 298-308.
44. F. Franchetti, S. Kral, J. Lorenz, and C. Ueberhuber, "Efficient utilization of SIMD extensions," Proc. IEEE, vol. 93, no. 2, pp. 409-425, Feb. 2005.
45. H. V. Sorensen, D. L. Jones, M. T. Heideman, and C. S. Burrus, "Real-valued fast Fourier transform algorithms," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-35, no. 6, pp. 849-863, Jun. 1987.
46. C. Temperton, "Fast mixed-radix real Fourier transforms," J. Comput. Phys., vol. 52, pp. 340-350, 1983.
47. G. D. Bergland, "A fast Fourier transform algorithm for real-valued series," Commun. ACM, vol. 11, no. 10, pp. 703-710, 1968.
48. R. N. Bracewell, The Hartley Transform. New York: Oxford Univ. Press, 1986.
49. H. J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms, 2nd ed. New York: Springer-Verlag, 1982.
50. J.-I. Guo, "An efficient design for one-dimensional discrete Hartley transform using parallel additions," IEEE Trans. Signal Process., vol. 48, no. 10, pp. 2806-2813, Oct. 2000.
51. Z. Wang, "Fast algorithms for the discrete W transform and for the discrete Fourier transform," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-32, no. 4, pp. 803-816, Aug. 1984.
52. S. A. Martucci, "Symmetric convolution and the discrete sine and cosine transforms," IEEE Trans. Signal Process., vol. 42, no. 5, pp. 1038-1051, May 1994.
53. K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. Boston, MA: Academic, 1990.
54. R. Vuduc and J. Demmel, "Code generators for automatic tuning of numerical kernels: Experiences with FFTW," presented at the Semantics, Application, and Implementation of Code Generators Workshop, Montreal, QC, Canada, 2000.
55. J. Makhoul, "A fast cosine transform in one and two dimensions," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-28, no. 1, pp. 27-34, Feb. 1980.
56. S. C. Chan and K. L. Ho, "Direct methods for computing discrete sinusoidal transforms," IEE Proc. F, vol. 137, no. 6, pp. 433-442, 1990.
57. Z. Wang, "On computing the discrete Fourier and cosine transforms," IEEE Trans. Acoust, Speech, Signal Process., vol. ASSP-33, no. 4, pp. 1341-1344, Oct. 1985.
58. S. C. Chan and K. L. Ho, "Fast algorithms for computing the discrete cosine transform," IEEE Trans. Circuits Syst. II: Analog Digit. Signal Process., vol. 39, no. 3, pp. 185-190, Mar. 1992.
59. J. C. Schatzman, "Accuracy of the discrete Fourier transform and the fast Fourier transform," SIAM J. Sci. Comput.,vol. 17, no. 5, pp. 1150-1166, 1996.
60. F. Franchetti, H. Karner, S. Kral, and C. W. Ueberhuber, "Architecture independent short vector FFTs," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, vol. 2, 2001, pp. 1109-1112.