This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms
August 1977 (vol. 26 no. 8)
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.
Index Terms:
Sequency-ordered Walsh transform, time-dependent spectral analysis, Walsh-Fourier transform.
Citation:
R.D. Brown, "A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms," IEEE Transactions on Computers, vol. 26, no. 8, pp. 819-822, Aug. 1977, doi:10.1109/TC.1977.1674921
Usage of this product signifies your acceptance of the Terms of Use.