Natural, Dyadic, and Sequency Order Algorithms and Processors for the Walsh-Hadamard Transform

Authors:
Y. A. Geadah;M. J. G. Corinthios
Affiliations:
Bell-Northern Research;-
Venue:
IEEE Transactions on Computers
Year:
1977

Citing 2
Cited 0

Fast Hardware Fourier Transformation Through Counting

IEEE Transactions on Computers
The Design of a Class of Fast Fourier Transform Computers

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

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.