论文信息 - Computation of running discrete Hartley transform coefficients

Computation of running discrete Hartley transform coefficients

Abstract This work presents a fast algorithm for computation of the running discrete Hartley transform (RHT) coefficients. The method is based on the close relations between the running discrete Fourier transform and the RHT. For N point RHT only 2 N real multiplications are needed. The method is faster than some other digital filter approaches. The outcome of the algorithm enables also fast computation of the running discrete Fourier transform coefficients.

Hannu Olkkonen

[1] R. Bracewell. The fast Hartley transform , 1984, Proceedings of the IEEE.

[2] P. K. Bondyopadhyay. Application of running Hartley transform in adaptive digital filtering , 1988 .

[3] Jie-Cherng Liu,et al. Hartley series and notch Hartley transform , 1990 .

[4] Henrique S. Malvar. Fast computation of the discrete cosine transform and the discrete Hartley transform , 1987, IEEE Trans. Acoust. Speech Signal Process..

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

[6] J. Prado. Comments on "The fast Hartley transform" , 1985 .

[7] A. Papoulis. Signal Analysis , 1977 .

[8] Ramdas Kumaresan,et al. Vector-radix algorithm for a 2-D discrete Hartley transform , 1986 .

[9] G.E.J. Bold. A comparison of the time involved in computing fast Hartley and fast Fourier transforms , 1985, Proceedings of the IEEE.