SPL
- 1 May 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 36 (5), 298-308
- https://doi.org/10.1145/378795.378860
Abstract
We discuss the design and implementation of a compiler that translates formulas representing signal processing transforms into efficient C or Fortran programs. The formulas are represented in a language that we call SPL, an acronym from Signal Processing Language. The compiler is a component of the SPIRAL system which makes use of formula transformations and intelligent search strategies to automatically generate optimized digital signal processing (DSP) libraries. After a discussion of the translation and optimization techniques implemented in the compiler, we use SPL formulations of the fast Fourier transform (FFT) to evaluate the compiler. Our results show that SPIRAL, which can be used to implement many classes of algorithms, produces programs that perform as well as “hard-wired” systems like FFTW.Keywords
This publication has 6 references indexed in Scilit:
- FFTW: an adaptive software architecture for the FFTPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- In search of the optimal Walsh-Hadamard transformPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A fast Fourier transform compilerPublished by Association for Computing Machinery (ACM) ,1999
- Optimizing matrix multiply using PHiPACPublished by Association for Computing Machinery (ACM) ,1997
- Algorithms for Discrete Fourier Transform and ConvolutionPublished by Springer Nature ,1997
- A methodology for designing, modifying, and implementing Fourier transform algorithms on various architecturesCircuits, Systems, and Signal Processing, 1990