The Community for Technology Leaders
Green Image
Issue No. 08 - August (1977 vol. 26)
ISSN: 0018-9340
pp: 819-822
R.D. Brown , Computer Sciences Corporation
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.
Sequency-ordered Walsh transform, time-dependent spectral analysis, Walsh-Fourier transform.

R. Brown, "A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms," in IEEE Transactions on Computers, vol. 26, no. , pp. 819-822, 1977.
81 ms
(Ver 3.3 (11022016))