This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Natural, Dyadic, and Sequency Order Algorithms and Processors for the Walsh-Hadamard Transform
May 1977 (vol. 26 no. 5)
pp. 435-442
Y.A. Geadah, Bell-Northern Research
The Walsh-Hadamard transform has recently received increasing attention in engineering applications due to the simplicity of its implementation and to its properties which are similar to the familiar Fourier transform. The transform matrices found so far to possess fast algorithms are the naturally ordered and dyadically ordered matrices, whose algorithms are similar to the Cooley-Tukey algorithm, and to the machine-oriented algorithm of Corinthios [2], respectively.
Index Terms:
Computer architecture, digital filtering, digital signal processing, fast Fourier transform (FFT), fast Walsh-Hadamard transform, spectral analysis, time-series analysis.
Citation:
Y.A. Geadah, M.J.G. Corinthios, "Natural, Dyadic, and Sequency Order Algorithms and Processors for the Walsh-Hadamard Transform," IEEE Transactions on Computers, vol. 26, no. 5, pp. 435-442, May 1977, doi:10.1109/TC.1977.1674860
Usage of this product signifies your acceptance of the Terms of Use.