New vector-radix algorithm for computing two-dimensional discrete Hartley transform

This paper presents an efficient vector-radix fast Hartley transform (VR-2²×2²-FHT) algorithm for computing the two dimensional discrete Hartley transform (2-D DHT). The proposed algorithm achieves, at the same time, both the speed advantage of the vector-radix-4×4 FHT algorithm and the simplest structural complexity offered by vector-radix-2×2 algorithm. The algorithm is implemented its arithmetic complexity is analysed and compared to the existing 2-D FHT algorithms such as row-column (RC) approach and vector-radix (VR). The result of this comparison has shown that the proposed algorithm significantly reduces the number of operations compared to RC approach and noticeably better performance than VR algorithm.