The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1977 vol.26)
pp: 435-442
Y.A. Geadah , Bell-Northern Research
ABSTRACT
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
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool