论文信息 - On Computation of the Hadamard Transform and the R Transform in Ordered Form

On Computation of the Hadamard Transform and the R Transform in Ordered Form

This correspondence describes an improved computational algorithm for the Hadamard transform and the R transform. By performing the computation "in place", the number of storage locations is minimized and the speed is increased. The transformed coefficients are in the order of increasing sequency.

Murat Kunt

[1] H. Andrews,et al. Hadamard transform image coding , 1969 .

[2] L. J. Ulman. Computation of the Hadamard Transform and the R- Transform in Ordered Form , 1970, IEEE Transactions on Computers.

[3] Henning F. Harmuth,et al. A generalized concept of frequency and some applications , 1968, IEEE Trans. Inf. Theory.

[4] John L. Shanks,et al. Computation of the Fast Walsh-Fourier Transform , 1969, IEEE Transactions on Computers.

[5] Herbert J. Reitboeck,et al. A Transformation with Invariance Under Cyclic Permutation for Applications in Pattern Recognition , 1969, Inf. Control..