In search of the optimal Walsh-Hadamard transform
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6, 3347-3350 vol.6
- https://doi.org/10.1109/icassp.2000.860117
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.Keywords
This publication has 4 references indexed in Scilit:
- EXTENT: a portable programming environment for designing and implementing high-performance block recursive algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- FFTW: an adaptive software architecture for the FFTPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Computational Frameworks for the Fast Fourier TransformPublished by Society for Industrial & Applied Mathematics (SIAM) ,1992
- A methodology for designing, modifying, and implementing Fourier transform algorithms on various architecturesCircuits, Systems, and Signal Processing, 1990