A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms
- 1 August 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-26 (8) , 819-822
- https://doi.org/10.1109/TC.1977.1674921
Abstract
An algorithm has been developed for calculating sequency-ordered fast Walsh-Fourier transforms (FWT's) using an additive recursion formula. Sequency-ordered FWT's of an N-dimensioned sampled data set are generated by a summation recursion of FWT's on subintervals of the data set. The algorithm is fast (N log2 N summations), computer efficient, and can be applied to time-dependent spectral analysis of nonstationary phenomena such as speech.Keywords
This publication has 10 references indexed in Scilit:
- A Hybrid Walsh Transform ComputerIEEE Transactions on Computers, 1973
- Logical convolution and discrete Walsh and Fourier power spectraIEEE Transactions on Audio and Electroacoustics, 1972
- A sequency-ordered fast Walsh transformIEEE Transactions on Audio and Electroacoustics, 1972
- Some Comments Concerning Walsh FunctionsIEEE Transactions on Information Theory, 1972
- Transforms of generalized Walsh functionsProceedings of the IEEE, 1971
- A Generalized Technique for Spectral AnalysisIEEE Transactions on Computers, 1970
- Computation of the Fast Walsh-Fourier TransformIEEE Transactions on Computers, 1969
- A generalized concept of frequency and some applicationsIEEE Transactions on Information Theory, 1968
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- A Closed Set of Normal Orthogonal FunctionsAmerican Journal of Mathematics, 1923