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 :
Hadamard transform, invariance with cyclic data shifts, pattern recognition, R-transform, Walsh-Fourier transform.; Discrete transforms; Filtering; Flow graphs; Military computing; Minimization methods; Pattern recognition; Switching circuits; Symmetric matrices; Hadamard transform, invariance with cyclic data shifts, pattern recognition, R-transform, Walsh-Fourier transform.;
