Elliot Linzer, Ephraim Feig
Mathematics of Computation
Paper
Hadamard Transforms on Multiply/Add Architectures
Abstract
A new algorithm for computing Hadamard transforms is presented. If n is a power of four, then the new algorithm uses ⅞ n logn multiply/adds to compute a Hadamard transform of length n. © 1994 IEEE
Related
Don Coppersmith
Journal of Cryptology
Richard Arratia, Béla Bollobás, et al.
Discrete Applied Mathematics
Ephraim Feig, F. Alberto Grunbaum
Inverse Problems