Paper

01 Jan 1994

Hadamard Transforms on Multiply/Add Architectures

View publication

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

Paper

Partitioning nominal attributes in decision trees

Don Coppersmith, S.E. June Hong, et al.

Data Mining and Knowledge Discovery

Paper

Conditions for weak ergodicity of inhomogeneous Markov chains

Don Coppersmith, Chai Wah Wu

Statistics and Probability Letters

Paper

Minimal algorithms for bilinear forms may have divisions

Ephraim Feig

Journal of Algorithms

Paper

On two criteria for infinite random sequences

Don Coppersmith

Advances in Mathematics

View all publications