On computing the discrete Hartley transform
- 1 October 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 33 (5) , 1231-1238
- https://doi.org/10.1109/tassp.1985.1164687
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Prime factor FFT algorithms for real-valued seriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Conversion of FFT’s to Fast Hartley TransformsSIAM Journal on Scientific and Statistical Computing, 1986
- An extension of the discrete Fourier transformIEEE Transactions on Circuits and Systems, 1985
- ‘Split radix’ FFT algorithmElectronics Letters, 1984
- The fast Hartley transformProceedings of the IEEE, 1984
- Discrete Hartley transformJournal of the Optical Society of America, 1983
- Fast Fourier Transform and Convolution AlgorithmsPublished by Springer Nature ,1981
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- Index mappings for multidimensional formulation of the DFT and convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965