New split-radix algorithm for the discrete Hartley transform

This paper presents a split-radix algorithm that can flexibly compute the discrete Hartley transforms of various sequence lengths. Comparisons with previously reported algorithms are made in terms of the required number of additions and multiplications. It shows that the length-3*2^m DHTs need a smaller number of multiplications than the length-2^m DHTs. However, they both require about the same computational complexity in terms of the total number of additions and multiplications. Optimized computation of length-12, -16 and -24 DFTs are also provided