A New Method for the 3-D Discrete Hartley Transform

Abstract

In this correspondence, we propose a vector-radix algorithm for fast computation of 3-D discrete Hartley transform(DHT). For data sequences whose length is a power of three, a radix-3×3×3 decimation in frequency algorithm is developed. It decomposes a length-N×N×N DHT into twenty-seven length-(N/3)×(N/3)×(N/3) DHTs. Comparison of computational complexity with known algorithms shows that the proposed algorithm, in some cases, reduces significantly the number of arithmetic operation.