Comparison of algorithms for computing the two-dimensional discrete Hartley transform
Stephen E. Reichenbach, John C. Burton, Keith Miller · Journal of the Optical Society of America A · 1989
Three methods have been described for computing the two-dimensional, discrete Hartley transform. Two of these employ a separable transform; the third method, the vector-radix algorithm, does not require separability. In-place computation of the vector-radix method is described. Operation counts and execution times indicate that the vector-radix method is fastest.