A New Split-Radix FHT Algorithm for Length- DHTs
暂无分享,去创建一个
[1] R. Bracewell. Discrete Hartley transform , 1983 .
[2] Douglas L. Jones,et al. On computing the discrete Hartley transform , 1985, IEEE Trans. Acoust. Speech Signal Process..
[3] K.M.M. Prabhu,et al. New radix-3 FHT algorithm , 1990 .
[4] C. P. Kwong,et al. Structured fast Hartley transform algorithms , 1986, IEEE Trans. Acoust. Speech Signal Process..
[5] P. Duhamel,et al. `Split radix' FFT algorithm , 1984 .
[6] Wan-Chi Siu,et al. On prime factor mapping for the discrete Hartley transform , 1992, IEEE Trans. Signal Process..
[7] Hsieh S. Hou,et al. The Fast Hartley Transform Algorithm , 1987, IEEE Transactions on Computers.
[8] Wan-Chi Siu,et al. Fast radix-3/9 discrete Hartley transform , 1993, IEEE Trans. Signal Process..
[9] Dekun Yang,et al. Prime factor fast Hartley transform , 1990 .
[10] K.M.M. Prabhu,et al. FHT algorithm for length N=q.2/sup m/ , 1999 .
[11] R. Tolimieri,et al. The tensor product: a mathematical programming language for FFTs and other fast DSP operations , 1992, IEEE Signal Processing Magazine.
[12] Guoan Bi. Split radix algorithm for the discrete Hartley transform , 1994 .
[13] Wan-Chi Siu,et al. NEW FAST DISCRETE HARTLEY TRANSFORM ALGORITHM , 1991 .
[14] Martin Vetterli,et al. Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data , 1987, IEEE Trans. Acoust. Speech Signal Process..
[15] Guoan Bi,et al. Fast DFT Algorithms for Length , 1998 .
[16] Edmond A. Jonckheere,et al. Split-radix fast Hartley transform in one and two dimensions , 1991, IEEE Trans. Signal Process..