A fast Fourier transform compiler

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 5, 1999, Pages 169-180

  Frigo, Matteo ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348209599     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/301631.301661     Document Type: Article

References (33)

1. Myoung An, James W. Cooley, and Richard Tolimieri. Factorization method for crystallographic Fourier transforms. Advances in Applied Mathematics, 11:358-371, 1990.
2. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers, principles, techniques, and tools. Addison-Wesley, March 1986.
3. Alok Aggarwal and Jeffrey Scott Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, September 1988.
4. Robert D. Blumofe, Matteo Frigo, Chrisopher F. Joerg, Charles E. Leiserson, and Keith H. Randall. An analysis of dag-consistent distributed shared-memory algorithms. In Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 297-308, Padua, Italy, June 1996.
5. R. E. Crochiere and A. V. Oppenheim. Analysis of linear digital networks. Proceedings of the IEEE, 63:581-595, April 1975.
6. J. W. Cooley and J. W. Tukey. An algorithm for the machine computation of the complex Fourier series. Mathematics of Computation, 19:297-301, April 1965.
7. P. Duhamel and M. Vetterli. Fast Fourier transforms: a tutorial review and a state of the art. Signal Processing, 19:259-299, April 1990.
8. Matteo Frigo and Steven G. Johnson. The FFTW web page. http://theory.lcs.mit.edu/~fftw.
9. Matteo Frigo and Steven G. Johnson. The fastest Fourier transform in the West. Technical Report MIT-LCS-TR-728, MIT Lab for Computer Science, September 1997. The description of the codelet generator given in this report is no longer current.
10. Matteo Frigo and Steven G. Johnson. FFTW: An adaptive software architecture for the FFT. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, volume 3, pages 1381-1384, Seattle, WA, May 1998.
11. Matteo Frigo, Charles E. Leiserson, and Keith H. Randall. The implementation of the Cilk-5 multithreaded language. In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), pages 212-223, Montreal, Canada, June 1998. ACM.
12. S. K. S. Gupta, C.-H. Huang, P. Sadayappan, and R. W. Johnson. A framework for generating distributed-memory parallel programs for block recursive algorithms. Journal of Parallel and Distributed Computing, 34(2):137-153, 1 May 1996.
13. Jia-Wei Hong and H. T. Kung. I/O complexity: the red-blue pebbling game. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pages 326-333, Milwaukee, 1981.
14. P. H. Hartel and W. G. Vree. Arrays in a lazy functional language - a case study: the fast Fourier transform. In G. Hains and L. M. R. Mullin, editors, Arrays, functional languages, and parallel systems (ATABLE), pages 52-66, June 1992.
15. H. W. Johnson and C. S. Burrus. The design of optimal DFT algorithms using dynamic programming. IEEE Transactions on Acoustics, Speech and Signal Processing, 31:378-387, April 1983.
16. Donald E. Knuth. The Art of Computer Programming, volume 2 (Seminumerical Algorithms). Addison-Wesley, 3rd edition, 1998.
17. Joanna L. Kulik. Implementing compiler optimizations using parallel graph reduction. Master's thesis, Massachussets Institute of Technology, February 1995.
18. Xavier Leroy. The Objective Caml system release 2.00. Institut National de Recherche en Informatique at Automatique (INRIA), August 1998.
19. J. A. Maruhn. FOURGEN: a fast Fourier transform program generator. Computer Physics Communications, 12:147-162, 1976.
20. Steven S. Muchnick. Advanced Compiler Design Implementation. Morgan Kaufmann, 1997.
21. A. V. Oppenheim and R. W. Schafer. Discrete-time Sig. nal Processing. Prentice-Hall, Englewood Cliffs, NJ 07632, 1989.
22. Will Partain. The nofib benchmark suite of Haskell programs. In J. Launchbury and P. M. Sansom, editors, Functional Programming, Workshops in Computing, pages 195-202. Springer Verlag, 1992.
23. F. Perez and T. Takaoka. A prime factor FFT algorithm implementation using a program generation technique. IEEE Transactions on Acoustics, Speech and Signal Processing, 35(8):1221-1223, August 1987.
24. C. M. Rader. Discrete Fourier transforms when the number of data samples is prime. Proc. of the IEEE, 56:1107-1108, June 1968.
25. I. Selesnick and C. S. Burrus. Automatic generation of prime length FFT programs. IEEE Transactions on Signal Processing, pages 14-24, January 1996.
26. H. V. Sorensen, D. L. Jones, M. T. Heideman, and C. S. Burrus. Real-valued fast Fourier transform algorithms. IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-35(6):849-863, June 1987.
27. Richard Tolimieri, Myoung An, and Chao Lu. Algorithms for Discrete Fourier Transform and Convolution. Springer Verlag, 1997.
28. Todd Veldhuizen. Using C++ template metaprograms. C++ Report, 7(4):36-43, May 1995. Reprinted in C++ Gems, ed. Stanley Lippman.
29. Todd Veldhuizen. Using C++ template metaprograms. C++ Report, 7(4):36-43, May 1995. Reprinted in C++ Gems, ed. Stanley Lippman.
30. J. S. Vitter and E. A. M. Shriver. Optimal algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994. double special issue on Large-Scale Memories.
31. J. S. Vitter and E. A. M. Shriver. Optimal algorithms for parallel memory II: Hierarchical multilevel memories. Algorithmica, 12(2-3):148-169, 1994. double special issue on Large-Scale Memories.
32. Philip Wadler. How to declare an imperative. ACM Computing Surveys, 29(3):240-263, September 1997.
33. S. Winograd. On computing the discrete Fourier transform. Mathematics of Computation, 32(1):175-199, January 1978.