Polynomial transform algorithms for multidimensional discrete Hartley transform

Polynomial algorithms for multidimensional discrete Hartley transform (MD-DHT) are proposed. Based on the multidimensional polynomial Transform, the MD-DHT is converted into a series of one-dimensional type-II discrete W transforms (DWT). The algorithms are clearly described and detailed analysis of the computational complexity is also presented, The proposed algorithm achieves considerable savings on the number of operations. The number of multiplications for computing an r-dimensional DHT is only 1/r times that needed by the row-column method. The number of additions is also reduced considerably