A new structure for the running discrete Hartley transform

Abstract This paper presents a new algorithm for computing the running Discrete Hartley Transform (DHT). The architecture for implementing the proposed algorithm is given which is in effect a new real time DHT analyser. The main advantages of the proposed technique include a reduction in hardware complexity and an increase in processing speed.

[1]  Jie-Cherng Liu,et al.  Running DHT and real-time dht analyser , 1988 .

[2]  K. M. M. Prabhu,et al.  Fast Hartley transform pruning , 1991, IEEE Trans. Signal Process..

[3]  R. Bracewell.  Discrete Hartley transform , 1983 .

[4]  D. Lipka,et al.  Fast Hartley transform algorithm , 1985 .

[5]  Hsieh S. Hou,et al.  The Fast Hartley Transform Algorithm , 1987, IEEE Transactions on Computers.

[6]  K. J. Ray Liu,et al.  Optimal unified architectures for the real-time computation of time-recursive discrete sinusoidal transforms , 1994, IEEE Trans. Circuits Syst. Video Technol..

[7]  Douglas L. Jones,et al.  On computing the discrete Hartley transform , 1985, IEEE Trans. Acoust. Speech Signal Process..