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

Shape rectangularization problems in intensity-modulated radiation therapy

Nikhil Bansal, Danny Z. Chen, et al.

Algorithmica (New York)

Paper

The multiplicative complexity of discrete cosine transforms

Ephraim Feig, Elliot Linzer

Advances in Applied Mathematics

Conference paper

Sparse source-wise and pair-wise distance preservers

Don Coppersmith, Michael Elkin

SODA 2005

Paper

Modified ffts for fused multiply-add architectures

Elliot Linzer, Ephraim Feig

Mathematics of Computation

View all publications