DocumentCode
1623640
Title
Fast computation of the discrete Walsh transform
Author
Sundararajan, D. ; Ahmad, M.O.
Author_Institution
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
Volume
2
fYear
1996
Firstpage
785
Abstract
A new discrete Walsh transform (DWT) algorithm is derived in which a modified form of the DWT relation is decomposed into smaller-sized transforms using vectorized quantities. The proposed approach results in an algorithm requiring no independent data swapping, and less number of array-index updating and bit-reversal operations. These reductions in the overhead operations readily translate into a significant reduction in the execution time compared with the existing algorithm
Keywords
Walsh functions; computational complexity; transforms; array-index updating; bit-reversal operations; discrete Walsh transform; execution time; smaller-sized transforms; vectorized quantities; Algorithm design and analysis; Discrete transforms; Discrete wavelet transforms; Error correction; Error correction codes; Filtering; Image coding; Image processing; Image recognition; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1996., IEEE 39th Midwest symposium on
Conference_Location
Ames, IA
Print_ISBN
0-7803-3636-4
Type
conf
DOI
10.1109/MWSCAS.1996.588028
Filename
588028
Link To Document