Fast DFT Algorithms for Length
Guoan Bi, Yan Qiu Chen · 1998
This correspondence presents an improved split-radix algo- rithm that can flexibly compute the discrete Hartley transforms (DHT) of length- where 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.