Unified Matrix Treatment of the Fast Walsh-Hadamard Transform

DOI10.1109/TC.1976.1674569zbMATH Open0357.44004WikidataQ56883079 ScholiaQ56883079MaRDI QIDQ4129904FDOQ4129904

Authors: Bernard Fino, V. Ralph Algazi 

Publication date: 1976

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Special integral transforms (Legendre, Hilbert, etc.) (44A15)

Cited In (8)

• The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform
• Fast orthogonal transforms and generation of Brownian paths
• Entropy computation for oscillator-based physical random number generators
• A generalized approach to modeling of the orthogonal transform algorithms
• Hadamard transforms and analysis on Cayley-Dickson algebras
• Recursive quantum circuits for generating sequency ordering Walsh-Hadamard transform
• RidgeSketch: a fast sketching based solver for large scale ridge regression
• Full-span log-linear model and fast learning algorithm

This page was built for publication: Unified Matrix Treatment of the Fast Walsh-Hadamard Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4129904)