The Fast Hartley Transform Algorithm

The fast Hartley transform (FHT) is similar to the Cooley-Tukey fast Fourier transform (FFT) but performs much faster because it requires only real arithmetic computations compared to the complex arithmetic computations required by the FFT. Through use of the FHT, discrete cosine transforms (DCT) and discrete Fourier transforms (DFT) can be obtained. The recursive nature of the FHT algorithm derived in this paper enables us to generate the next higher order FHT from two identical lower order FHT's. In practice, this recursive relationship offers flexibility in programming different sizes of transforms, while the orderly structure of its signal flow-graphs indicates an ease of implementation in VLSI.

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

[2]  Zhongde Wang.  Fast algorithms for the discrete W transform and for the discrete Fourier transform , 1984 .

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

[4]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

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

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

[7]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[8]  Oscar Buneman.  Conversion of FFT's to Fast Hartley Transforms , 1986 .

[9]  Henrique S. Malvar.  Fast computation of discrete cosine transform through fast Hartley transform , 1986 .

[10]  S. Zohar.  Winograd's Discrete Fourier Transform Algorithm , 1981 .

[11]  M. Vetterli,et al.  Simple FFT and DCT algorithms with reduced number of operations , 1984 .

[12]  S. Winograd.  On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[13]  R. Kumaresan,et al.  A prime factor FFT algorithm with real valued arithmetic , 1985, Proceedings of the IEEE.

[14]  Soo-Chang Pei,et al.  Split-radix fast Hartley transform , 1986 .

[15]  W. J. Karplus,et al.  The fast Hartley transform on the hypercube multiprocessors , 1989, C3P.

[16]  William B. Kendall,et al.  A New Algorithm for Computing Correlations , 1974, IEEE Transactions on Computers.

[17]  M. J. Narasimha,et al.  On the Computation of the Discrete Cosine Transform , 1978, IEEE Trans. Commun..

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

[19]  Kenneth L. Caspari,et al.  Computer techniques in image processing , 1972 .

[20]  R. Clarke,et al.  Relation between the Karhunen Loève and cosine transforms , 1981 .

[21]  Kou-Hu Tzou,et al.  A Study Of The Discrete Hartley Transform For Image Compression Applications , 1985, Photonics West - Lasers and Applications in Science and Engineering.