Computation of the Hadamard Transform and the R- Transform in Ordered Form
IEEE Transactions on Computers
Computation of the Fast Walsh-Fourier Transform
IEEE Transactions on Computers
Hi-index | 14.98 |
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.