Fast DHT algorithms for length N=q*2m

This article presents an improved split-radix algorithm that can flexibly compute the discrete Hartley transforms (DHT) of length-q*2^m where q is an odd integer. Comparisons with previously reported algorithms show that savings on the number of arithmetic operations can be made. Furthermore, a wider range of choices on different DHT lengths is naturally provided