Computation of the Hadamard Transform and the R- Transform in Ordered Form
- 1 April 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-19 (4) , 359-360
- https://doi.org/10.1109/t-c.1970.222925
Abstract
This correspondence describes a method of computing the Hadamard transform and the R-transform. This method produces the transform components in the order of the increasing sequency of the Walsh functions represented by the rows of a symmetric Hadamard matrix for which the sequency of each row is larger than the sequency of the preceding row.Keywords
This publication has 4 references indexed in Scilit:
- A transformation with invariance under cyclic permutation for applications in pattern recognitionInformation and Control, 1969
- Computation of the Fast Walsh-Fourier TransformIEEE Transactions on Computers, 1969
- Hadamard transform image codingProceedings of the IEEE, 1969
- A generalized concept of frequency and some applicationsIEEE Transactions on Information Theory, 1968