Fast radix-3/9 discrete Hartley transform

An efficient algorithm for computing radix-3/9 discrete Hartley transforms (DHTs) is presented. It is shown that the radix-3/9 fast Hartley transform (FHT) algorithm reduces the number of multiplications required by a radix-3 FHT algorithm for nearly 50%. For the computation of real-valued discrete Fourier transforms (DFTs) with sequence lengths that are powers of 3, it is shown that the radix-3/9 FHT algorithm reduces the number of multiplications by 16.2% over the fastest real-valued radix-3/9 fast Fourier transform (FFT) algorithm. >

[1]  Wan-Chi Siu,et al.  On prime factor mapping for the discrete Hartley transform , 1992, IEEE Trans. Signal Process..

[2]  Ken'iti Kido,et al.  A new FFT algorithm of radix 3, 6, and 12 , 1986, IEEE Trans. Acoust. Speech Signal Process..

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

[4]  K.M.M. Prabhu,et al.  New radix-3 FHT algorithm , 1990 .

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

[6]  Martin Vetterli,et al.  Split-radix algorithms for length-pm DFT's , 1989, IEEE Trans. Acoust. Speech Signal Process..

[7]  Henrique S. Malvar,et al.  Corrections to "Fast Computation of the Discrete Cosine Transform and the Discrete Hartley Transform" , 1988 .

[8]  Tapan K. Sarkar,et al.  A Generalized Approach to Direction Finding , 1986, MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's.

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