Fast computation of R-dimensional DHT with size Q(L/sub 1/)/spl times/Q(L/sub 2/)/spl times/.../spl times/Q(L/sub R/)
Fast algorithms are presented for multi-dimensional discrete Hartley transform (MD-DHT) with size q(l/sub 1/)/spl times/q(l/sub 2/)/spl times/.../spl times/q(l/sub r/), where q is an odd prime number, and r>1 is the number of dimensions. By using the multi-dimensional polynomial transform, the MD-DHT can be converted into a series of reduced one-dimensional DHTs. Compared to other fast algorithms, the proposed one substantially reduces the overall computational complexity and has a simple computational structure.