Computation of the Fast Walsh-Fourier Transform
- 1 May 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-18 (5), 457-459
- https://doi.org/10.1109/t-c.1969.222685
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
This publication has 9 references indexed in Scilit:
- Hadamard transform image codingProceedings of the IEEE, 1969
- A generalized concept of frequency and some applicationsIEEE Transactions on Information Theory, 1968
- What is the fast Fourier transform?Proceedings of the IEEE, 1967
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- Some Notes on the Walsh FunctionsIEEE Transactions on Electronic Computers, 1964
- The Search for Hadamard MatricesThe American Mathematical Monthly, 1963
- A review of orthogonal square-wave functions and their application to linear networksJournal of the Franklin Institute, 1962
- The Generalized Walsh FunctionsTransactions of the American Mathematical Society, 1950
- A Closed Set of Normal Orthogonal FunctionsAmerican Journal of Mathematics, 1923