Abstract
SPIRAL is a generator of optimized, platform-adapted libraries for digital signal processing algorithms. SPIRAL’s strategy translates the implementation task into a search in an expanded space of alternatives. These result from the many degrees of freedom in the DSP algorithm itself and in the various coding choices. This paper describes the framework to represent and generate efficiently these alternatives: the formula generator module in SPIRAL. We also address the search module that works in tandem with the formula generator in a feedback loop to find optimal implementations. These modules are implemented using the computer algebra system GAP/AREP.
Chapter PDF
Similar content being viewed by others
Keywords
- Formula Generator
- Discrete Cosine Transform
- Discrete Fourier Transform
- Digital Signal Processing
- Computer Algebra System
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. M. F. Moura, J. Johnson, R. W. Johnson, D. Padua, V. Prasanna, M. Püschel, and M. M. Veloso, “ SPIRAL: Portable Library of Optimized Signal Processing Algorithms” 1998, http://www.ece.cmu.edu/~spiral.
Matteo Frigo and Steven G. Johnson, “FFTW: An adaptive software architecture for the FFT” in ICASSP 98, 1998, vol. 3, pp. 1381–1384, http://www.fftw.org.
C. Überhuber et.al., “Aurora” http://www.math.tuwien.ac.at/~aurora/.
M. Thottethodi, S. Chatterjee, and A. R. Lebeck, “Tuning Strassen’s Matrix Multiplication for Memory Efficiency” in Proc. SC98: High Performance Networking and Computing, 1998.
J. Demmel et.al., “PHIPAC” http://www.icsi.berkeley.edu/~bilmes/phipac/.
R. C. Whaley, A. Petitet, and J. J. Dongarra, “Automated Empirical Optimization of Software and the ATLAS project” Tech. Rep., University of Knoxville, Tennessee, 2000, http://www.netlib.org/atlas/.
J. Xiong, D. Padua, and J. Johnson, “SPL: A Language and Compiler for DSP Algorithms” in Proc. PLDI, 2001, to appear.
The GAP Team, University of St. Andrews, Scotland, GAP-Groups, Algorithms, and Programming, 1997, http://www-gap.dcs.st-and.ac.uk/~gap/.
J. Johnson and R. W. Johnson, “Automatic generation and implementation of FFT algorithms” in Proc. SIAM Conf. Parallel Proc. for Sci. Comp., 1999, CD-Rom.
J. W. Cooley and J. W. Tukey, “An algorithm for the machine calculation of complex Fourier series” Math. of Computation, vol. 19, pp. 297–301, 1965.
K. R. Rao and J. J. Hwang, Techniques & standards for image, video and audio coding, Prentice Hall PTR, 1996.
R. Tolimieri, M. An, and C. Lu, Algorithms for discrete Fourier transforms and convolution, Springer, 2nd edition, 1997.
Z. Wang, “ Fast Algorithms for the Discrete W Transform and for the Discrete Fourier Transform ” IEEE Trans. on Acoustics, Speech, and Signal Processing, vol. ASSP-32, no. 4, pp. 803–816, 1984.
S. Egner and M. Püschel, AREP-Constructive Representation Theory and Fast Signal Transforms, GAP share package, 1998, http://www.ece.cmu.edu/~smart/arep/arep.html.
H. W. Johnson and C. S. Burrus, “The design of optimal DFT algorithms using dynamic programming” IEEE Trans, on Acoustics, Speech, and Signal Processing, vol. ASSP-31, pp. 378–387, 1983.
B. Singer and M. Veloso, “Stochastic search for signal processing algorithm optimization” in Conf. on Uncertainty in Artificial Intelligence, 2001, submitted.
David E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Püschel, M., Singer, B., Veloso, M., Moura, J.M.F. (2001). Fast Automatic Generation of DSP Algorithms. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science — ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45545-0_19
Download citation
DOI: https://doi.org/10.1007/3-540-45545-0_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42232-7
Online ISBN: 978-3-540-45545-5
eBook Packages: Springer Book Archive