Title :
A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms
Author_Institution :
Computer Sciences Corporation
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 :
Sequency-ordered Walsh transform, time-dependent spectral analysis, Walsh-Fourier transform.; Contracts; Discrete transforms; Equations; Fast Fourier transforms; Silver; Sparse matrices; Spectral analysis; Speech analysis; Springs; Sequency-ordered Walsh transform, time-dependent spectral analysis, Walsh-Fourier transform.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1977.1674921
