In search of the optimal Walsh-Hadamard transform

Authors:
J. Johnson;M. Puschel
Affiliations:
Dept. of Math. & Comput. Sci., Drexel Univ., Philadelphia, PA, USA;-
Venue:
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06
Year:
2000

Citing 0
Cited 11

SPL: a language and compiler for DSP algorithms

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Stochastic search for signal processing algorithm optimization

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
A Prototypical Self-Optimizing Package for Parallel Implementation of Fast Signal Transforms

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Searching for the Best FFT Formulas with the SPL Compiler

LCPC '00 Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers
Learning to construct fast signal processing implementations

The Journal of Machine Learning Research
Spiral: A Generator for Platform-Adapted Libraries of Signal Processing Algorithms

International Journal of High Performance Computing Applications
Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform

Theoretical Computer Science
Bandit-based optimization on graphs with application to library performance tuning

ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Automated performance tuning

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Blendenpik: Supercharging LAPACK's Least-Squares Solver

SIAM Journal on Scientific Computing
Parameterized micro-benchmarking: an auto-tuning approach for complex applications

Proceedings of the 9th conference on Computing Frontiers

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper describes an approach to implementing and optimizing fast signal transforms. Algorithms for computing signal transforms are expressed by symbolic expressions, which can be automatically generated and translated into programs. Optimizing an implementation involves searching for the fastest program obtained from one of the possible expressions. We apply this methodology to the implementation of the Walsh-Hadamard transform. An environment, accessible from MATLAB, is provided for generating and timing WHT algorithms. These tools are used to search for the fastest WHT algorithm. The fastest algorithm found is substantially faster than standard approaches to implementing the WHT. The work reported in this paper is part of the SPIRAL project. An ongoing project whose goal is to automate the implementation and optimization of signal processing algorithms.