Abstract
A new algorithm for computing Hadamard transforms is presented. If n is a power of four, then the new algorithm uses ⅞ n log<inf>2</inf>n multiply/adds to compute a Hadamard transform of length n. © 1994 IEEE
A new algorithm for computing Hadamard transforms is presented. If n is a power of four, then the new algorithm uses ⅞ n log<inf>2</inf>n multiply/adds to compute a Hadamard transform of length n. © 1994 IEEE