Automatic derivation and implementation of signal processing algorithms

Authors:
Affiliations:
Venue:
ACM SIGSAM Bulletin
Year:
2001

Citing 4
Cited 3

A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures

Circuits, Systems, and Signal Processing
Computational frameworks for the fast Fourier transform

Computational frameworks for the fast Fourier transform
SPL: a language and compiler for DSP algorithms

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Automatic generation of fast discrete signal transforms

IEEE Transactions on Signal Processing

Decomposing monomial representations of solvable groups

Journal of Symbolic Computation
Linear analysis and optimization of stream programs

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Design and evaluation of a compiler for embedded stream programs

Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a computer algebra framework to automatically derive and implement algorithms for digital signal processing. The two main parts of the framework are AREP, a library for symbolic manipulation of group representations and structured matrices, and SPL, a compiler turning matrix expressions into efficient imperative-style numerical programs.