Fast computation of the discrete Hartley transform

Two approaches to the computation of the discrete Hartley transform (DHT) are proposed. The first approach is based on computing a prime length DHT using a radix-2 number-theoretic transform. The number of multiplications required in this method is equal to N-1, which is less than the number of multiplications required for direct computation of the DHT using radix-2 or split radix algorithms. In the second approach, short-term transforms are implemented with rotations replacing multiplications. The availability of VLSI cordic processors implementing circular rotation makes this approach an interesting alternative to the realization of the transform