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, Compariso ns with previously reported algorithms are made in terms of the requir ed number of additions and multiplications, It shows that the length-3 2(m) DHT's need a smaller number of multiplications than the length-2 (m) DHT's. However, they both require about the same computational com plexity in terms of the total number of additions and multiplications. Optimized computation of length-12, -16 and -24 DPT's are also provid ed.