Conference proceeding
SPL: a language and compiler for DSP algorithms
Proceedings of the ACM SIGPLAN 2001 conference on programming language design and implementation, pp 298-308
01 May 2001
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.
Metrics
13 Record Views
Details
- Title
- SPL
- Creators
- Jianxin XiongJeremy JohnsonRobert JohnsonDavid Padua
- Publication Details
- Proceedings of the ACM SIGPLAN 2001 conference on programming language design and implementation, pp 298-308
- Series
- PLDI '01
- Publisher
- Association for Computing Machinery (ACM)
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Computer Science
- Other Identifier
- 991014878335104721