A sequency-ordered fast Walsh transform
- 1 August 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Audio and Electroacoustics
- Vol. 20 (3), 204-205
- https://doi.org/10.1109/tau.1972.1162377
Abstract
A method is described that yields the fast Walsh transform (FWT) in sequency order. The advantages of this method over others are: 1) it is based on the Cooley-Tukey-type fast Hadamard transform (FHT) algorithm, 2) the computational effort is identical to the conventional FHT, and 3) the transform remains its own inverse.Keywords
This publication has 6 references indexed in Scilit:
- Walsh Functions and Gray CodeIEEE Transactions on Electromagnetic Compatibility, 1971
- A generalized discrete transformProceedings of the IEEE, 1971
- Computation of the Fast Walsh-Fourier TransformIEEE Transactions on Computers, 1969
- Transmission of Information by Orthogonal FunctionsPublished by Springer Nature ,1969
- Walsh functions and Hadamard matrixesElectronics Letters, 1966
- Some Notes on the Walsh FunctionsIEEE Transactions on Electronic Computers, 1964