2000 character limit reached
Radix-2 Fast Hartley Transform Revisited (1503.03794v1)
Published 12 Mar 2015 in cs.DM
Abstract: A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast DHT algorithms and a multiplication-free fast algorithm for the Hadamard Transform.