SPL: A language and compiler for DSP algorithms

J. Xiong, J. Johnson, R. Johnson, David A Padua

Research output: Contribution to conferencePaperpeer-review

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.

Original languageEnglish (US)
Pages298-308
Number of pages11
StatePublished - Jan 1 2001
EventACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI) - Snowbird, UT, United States
Duration: Jun 20 2001Jun 22 2001

Other

OtherACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI)
Country/TerritoryUnited States
CitySnowbird, UT
Period6/20/016/22/01

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'SPL: A language and compiler for DSP algorithms'. Together they form a unique fingerprint.

Cite this