Hadamard transforms on multiply/add architectures

A new algorithm for computing Hadamard transforms is presented. If n is a power of four, then the new algorithm uses 7/8 n log/sub 2/ n multiply/adds to compute a Hadamard transform of length n. >

[1]  Zhenyu Li,et al.  FFT and convolution algorithms on DSP microprocessors , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[2]  Erdem Hokenek,et al.  Design of the IBM RISC System/6000 Floating-Point Execution Unit , 1990, IBM J. Res. Dev..