Nikhil Bansal, Danny Z. Chen, et al.
Algorithmica (New York)
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, Chai Wah Wu
Statistics and Probability Letters
Don Coppersmith, David Gamarnik, et al.
Random Structures and Algorithms
Conference paper
Runlength encoding of quantized DCT coefficients
Viresh Ratnakar, Ephraim Feig, et al.
IS&T/SPIE Electronic Imaging 1995