On computing the discrete Hartley transform
暂无分享,去创建一个
Douglas L. Jones | C. Sidney Burrus | Henrik V. Sorensen | Michael T. Heideman | H. V. Sorensen | C. Burrus | M. Heideman | H. Sorensen
[1] R. Ansari. An extension of the discrete Fourier transform , 1985 .
[2] Glenn D. Bergland,et al. Numerical Analysis: A fast fourier transform algorithm for real-valued series , 1968, CACM.
[3] Oscar Buneman. Conversion of FFT's to Fast Hartley Transforms , 1986 .
[4] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[5] C. Sidney Burrus,et al. Prime factor FFT algorithms for real-valued series , 1984, ICASSP.
[6] R. Bracewell. Discrete Hartley transform , 1983 .
[7] C. Burrus. Index mappings for multidimensional formulation of the DFT and convolution , 1977 .
[8] R. Bracewell. The fast Hartley transform , 1984, Proceedings of the IEEE.
[9] S. Winograd. On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.
[10] P. Duhamel,et al. `Split radix' FFT algorithm , 1984 .