DocumentCode
1102442
Title
Computation of the Fast Walsh-Fourier Transform
Author
Shanks, John L.
Author_Institution
IEEE
Issue
5
fYear
1969
fDate
5/1/1969 12:00:00 AM
Firstpage
457
Lastpage
459
Abstract
The discrete, orthogonal Walsh functions can be generated by a multiplicative iteration equation. Using this iteration equation, an efficient Walsh transform computation algorithm is derived which is analogous to the Cooley-Tukey algorithm for the complex-exponential Fourier transform.
Keywords
Algorithm, Cooley-Tukey, Hadamard-Fourier, orthogonal, transform, Walsh-Fourier.; Conferences; Discrete Fourier transforms; Discrete transforms; Equations; Fast Fourier transforms; Fourier transforms; Petroleum; Algorithm, Cooley-Tukey, Hadamard-Fourier, orthogonal, transform, Walsh-Fourier.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1969.222685
Filename
1671278
Link To Document