Don Coppersmith
Journal of Cryptology
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
Ephraim Feig, Fred Greenleaf
Applied Optics
Rajesh Rajagopalan, Ephraim Feig, et al.
IEEE TCSVT
Ephraim Feig, Elliot Linzer
IEEE TSP