Radix-3, times, 3 Algorithm for The 2-D Discrete Hartley Transform

Published: 01 Jan 2008, Last Modified: 14 Nov 2024IEEE Trans. Circuits Syst. II Express Briefs 2008EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this correspondence, we propose a vector-radix algorithm for the fast computation of a 2-D discrete Hartley transform (DHT). For data sequences whose length is a power of three, a radix-3 times 3 decimation in frequency algorithm is developed. It decomposes a length-N times N DHT into nine length-(N/3) times N (N/3) DHTs. Comparison of the computational complexity with known algorithms shows that the proposed algorithm, in some cases, reduces significantly the number of arithmetic operations.
Loading