A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms

@article{Brown1977ARA,
  title={A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms},
  author={Robert J Brown},
  journal={IEEE Transactions on Computers},
  year={1977},
  volume={C-26},
  pages={819-822}
}
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. 
7 Citations
5 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-5 of 5 references

An algorithm for the machine computation of complex Fourier series

  • J. W. Tukey
  • IEEE Trans . Audio and Electroacoust .
  • 1972

Similar Papers

Loading similar papers…