The Community for Technology Leaders
Green Image
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.
Computer architecture, digital filtering, digital signal processing, fast Fourier transform (FFT), fast Walsh-Hadamard transform, spectral analysis, time-series analysis.

Y. Geadah and M. Corinthios, "Natural, Dyadic, and Sequency Order Algorithms and Processors for the Walsh-Hadamard Transform," in IEEE Transactions on Computers, vol. 26, no. , pp. 435-442, 1977.
90 ms
(Ver 3.3 (11022016))