Referenced Items are not available for this document.
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.
Published in:
Computers, IEEE Transactions on
(Volume:C-26
,
Issue:
8
)
Date of Publication: Aug. 1977
- Page(s):
- 819 - 822
- ISSN :
- 0018-9340
- Digital Object Identifier :
- 10.1109/TC.1977.1674921
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 21 August 2006
- Issue Date :
- Aug. 1977
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
