A fast running Hartley transform algorithm and its application in adaptive signal enhancement

A fast recursive algorithm for computation of the running discrete Hartley transform (RDHT) is presented. This method is based on the relation between the running discrete Fourier transform (RDFT) and the RDHT. The number of operations for the proposed recursive algorithm is only 2/N (N=length of the transform) of the direct computation of the RDHT. It also provides substantial computational savings compared with the recursive RDFT algorithm. A transform-domain adaptive digital filter is implemented based on the presented algorithm. Simulation results of its implementation on an adaptive line enhancer are given to demonstrate the efficiency of the presented fast algorithm.