Three algorithms for computing the 2-D discrete Hartley transform
Artyom M. Grigoryan, Sos С. Agaian · 2000
In this paper, three algorithms based on the method of vector and paired transforms for dividing the computation of the nonseparable two-dimensional discrete Hartley transform (2-D DHT) into the "minimal" number of the one-dimensional (1-D) DHT's are presented. The computational complexity of the proposed method is analyzed, and the comparative estimates revealing the efficiency of the proposed algorithms with respect to the known algorithms are given.