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

Authors:
L. J. Ulman
Affiliations:
Westinghouse Defense and Space Center
Venue:
IEEE Transactions on Computers
Year:
1970

Citing 1
Cited 5

Computation of the Fast Walsh-Fourier Transform

IEEE Transactions on Computers

A Simplified Definition of Walsh Functions

IEEE Transactions on Computers
Composite Spectra and the Analysis of Switching Circuits

IEEE Transactions on Computers
On Computation of the Hadamard Transform and the R Transform in Ordered Form

IEEE Transactions on Computers
Signal flow graph and a Fortran program for Haar-Fourier transform

IEEE Transactions on Computers
An efficient secure code approach based on indexed table quasi group encryption with Hadamard and Number Theoretic Transformation for software protection

Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology

Quantified Score

Hi-index	14.99

Visualization

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.