Fast Radix-2 Algorithm for the Discrete Hartley Transform of Type II

We present a new efficient method for the computation of the discrete Hartley transform of type II and radix-2 length
N
=2
n
. This recursive method requires a reduced number of arithmetic operations compared with existing methods and can be easily implemented. A new efficient method for the direct computation of a length N type-II DHT from two adjacent DHT-II sequences of length N/2 is also presented.