SPL: A language and compiler for DSP algorithms

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

Research output: Contribution to conferencePaper

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)
CountryUnited States
CitySnowbird, UT
Period6/20/016/22/01

Fingerprint

Digital signal processing
Signal processing
Fast Fourier transforms

ASJC Scopus subject areas

  • Software

Cite this

Xiong, J., Johnson, J., Johnson, R., & Padua, D. A. (2001). SPL: A language and compiler for DSP algorithms. 298-308. Paper presented at ACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI), Snowbird, UT, United States.

SPL : A language and compiler for DSP algorithms. / Xiong, J.; Johnson, J.; Johnson, R.; Padua, David A.

2001. 298-308 Paper presented at ACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI), Snowbird, UT, United States.

Research output: Contribution to conferencePaper

Xiong, J, Johnson, J, Johnson, R & Padua, DA 2001, 'SPL: A language and compiler for DSP algorithms', Paper presented at ACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI), Snowbird, UT, United States, 6/20/01 - 6/22/01 pp. 298-308.
Xiong J, Johnson J, Johnson R, Padua DA. SPL: A language and compiler for DSP algorithms. 2001. Paper presented at ACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI), Snowbird, UT, United States.
Xiong, J. ; Johnson, J. ; Johnson, R. ; Padua, David A. / SPL : A language and compiler for DSP algorithms. Paper presented at ACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI), Snowbird, UT, United States.11 p.
@conference{aafa17ee6ece4d0d9c7971cc91fbea60,
title = "SPL: A language and compiler for DSP algorithms",
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.",
author = "J. Xiong and J. Johnson and R. Johnson and Padua, {David A}",
year = "2001",
month = "1",
day = "1",
language = "English (US)",
pages = "298--308",
note = "ACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI) ; Conference date: 20-06-2001 Through 22-06-2001",

}

TY - CONF

T1 - SPL

T2 - A language and compiler for DSP algorithms

AU - Xiong, J.

AU - Johnson, J.

AU - Johnson, R.

AU - Padua, David A

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034826555&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034826555&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0034826555

SP - 298

EP - 308

ER -