Fast Hadamard Transform Using the H Diagram

Authors:
H. Y. L. Mar;C. L. Sheng
Affiliations:
Department of Electrical Engineering, University of Ottawa;-
Venue:
IEEE Transactions on Computers
Year:
1973

Citing 3
Cited 0

Parallel Processing with the Perfect Shuffle

IEEE Transactions on Computers
Computation of the Fast Walsh-Fourier Transform

IEEE Transactions on Computers
The H Diagram: A Graphical Approach to Logic Design

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

For the Hadamard matrix, a modified factorization procedure is developed that is likely as economical in storage requirements and in the number of computational operations as the conventional fast Hadamard transform. Using this specific factoring method, the procedure for obtaining the fast Hadamard transform may be interpreted as operations on an H diagram. The H diagram was originally derived by Marihugh and Anderson [1] to provide a graphical representation for logic functions.