An efficient three-dimensional decimation-in-time FHT algorithm based on the radix-2/4 approach
In this paper, a decimation-in-time (DIT) fast Hartley transform (FHT) algorithm is proposed for efficient computation of the three-dimensional (3-D) discrete Hartley transform (DHT). It is based on a mixture of radix-(2/spl times/2/spl times/2) and radix-(4/spl times/4/spl times/4) index maps. The proposed algorithm substantially reduces the number of arithmetic operations compared to the existing 3-D radix-(2/spl times/2/spl times/2) FHT algorithms.