Searching for the best FFT formulas with the SPL compiler

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2017, Issue , 2001, Pages 112-126

  Johnson, Jeremy ^a   Johnson, Robert W ^b   Padua, David A ^c   Xiong, Jianxin ^c  

^a DREXEL UNIVERSITY   (United States)

^b MathStar Inc   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FAST FOURIER TRANSFORMS; MATHEMATICAL TRANSFORMATIONS;

DOMAIN SPECIFIC; FAST ALGORITHMS; FAST IMPLEMENTATION; FAST SIGNAL; FORTRAN PROGRAMS; MATHEMATICAL FORMULAS; MATRIX FACTORIZATIONS; SIGNAL TRANSFORM;

PROGRAM COMPILERS;

EID: 23044531966     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45574-4_8     Document Type: Conference Paper

References (15)

1. L. Auslander, J. R. Johnson, and R. W. Johnson. Automatic implementation of FFT algorithms. Technical Report 96-01, Dept. of Math. and Computer Science, Drexel University, Philadelphia, PA, June 1996. Presented at the DARPA ACMP PI meeting.
2. J. W. Cooley and J. W. Tukey. An Algorithm for the Machine Calculation of Complex Fourier Series. Math. of Computation, 19:297–301, 1965.
3. M. Frigo. A fast fourier transform compiler. In PLDI’99, pages 169–180, 1999.
4. M. Frigo and S. G. Johnson. FFTW: An adaptive software architecture for the FFT. In ICASSP’98, volume 3, pages 1381–1384, 1998. http://www.fftw.org.
5. Johnson J., Johnson R., D Rodriguez, and R. Tolimieri. A Methodology for Designing, Modifying, and Implementing Fourier Transform Algorithms on Various Architectures. IEEE Trans. Circuits Sys., 9, 1990.
6. J. Johnson, R. Johnson, D. Padua, and J. Xiong. SPL: Signal Processing Language, 1999. http://www.ece.cmu.edu/∼spiral/SPL.html.
7. J. R. Johnson and R. W. Johnson. Automatic generation and implementation of FFT algorithms. In SIAM Conference on Parallel Processing for Scientific Computing, March 1999.
8. J. R. Johnson and M. Püschel. In search of the optimal Walsh-Hadamard transform. In Proc. ICASSP 2000, 2000.
9. T. Kisuki, P.M.W. Knijnenberg, M.F.P. O’Boyle, and H.A.G. Wijshoff. Iterative compilation in program optimization. In Proc. CPC2000, pages 35–44, 2000.
10. H. Massalin. Superoptimizer – a look at the smallest program. In Proc. ASPLOS II, pages 122–126, 1987.
11. J. M. F. Moura, J. Johnson, R. Johnson, D. Padua, V. Prasanna, and M. M. Veloso. SPIRAL: Portable Library of Optimized SP Algorithms, 1998. http://www.ece.cmu.edu/∼spiral/.
12. K. R. Rao and P. Yip. Discrete Cosine Transform. Academic Press, 1990.
13. R. Tolimieri, M. An, and C. Lu. Algorithms for Discrete Fourier Transforms and Convolution. Springer, 2nd edition, 1997.
14. C. Van Loan. Computational Framework of the Fast Fourier Transform. Siam, 1992.
15. R. Clint Whaley and Jack Dongarra. Automatically tuned linear algebra software (ATLAS), 1998. http://www.netlib.org/atlas/.