论文信息 - A novel algorithm for computing the 1-D discrete Hartley transform

A novel algorithm for computing the 1-D discrete Hartley transform

An efficient split algorithm for calculating the one-dimensional discrete Hartley transforms, by using a special partitioning in the frequency domain, is introduced. The partition determines a fast paired transform that splits the 2/sup r/-point unitary Hartley transform into a set of 2/sup r-n/-point odd-frequency Hartley transforms, n=1:r. A proposed method of calculation of the 2/sup r/-point Hartley transform requires 2/sup r-1/(r-3)+2 multiplications and 2/sup r-1/(r+9)-r/sup 2/-3r-6 additions.

Artyom M. Grigoryan | A. Grigoryan

[1] Wan-Chi Siu,et al. NEW FAST DISCRETE HARTLEY TRANSFORM ALGORITHM , 1991 .

[2] Artyom M. Grigoryan. Efficient algorithms for computing the 2-D hexagonal Fourier transforms , 2002, IEEE Trans. Signal Process..

[3] C. Burrus,et al. DFT/FFT and Convolution Algorithms: Theory and Implementation , 1991 .

[4] Guoan Bi,et al. Fast generalized DFT and DHT algorithms , 1998, Signal Process..

[5] S. Agaian,et al. Multidimensional Discrete Unitary Transforms: Representation: Partitioning, and Algorithms , 2003 .

[6] Sos S. Agaian,et al. Split manageable efficient algorithm for Fourier and Hadamard transforms , 2000, IEEE Trans. Signal Process..

[7] Charles M. Rader,et al. Fast transforms: Algorithms, analyses, applications , 1984 .

[8] O. K. Ersoy,et al. Generalized discrete Hartley transforms , 1991, China., 1991 International Conference on Circuits and Systems.

[9] Neng-Chung Hu,et al. Generalized discrete Hartley transforms , 1992, IEEE Trans. Signal Process..

[10] Ronald N. Bracewell. The Hartley transform , 1986 .

[11] Artyom M. Grigoryan. 2-D and 1-D multipaired transforms: frequency-time type wavelets , 2001, IEEE Trans. Signal Process..

[12] Miodrag Popovic,et al. A new look at the comparison of the fast Hartley and Fourier transforms , 1994, IEEE Trans. Signal Process..