Transforming real-valued sequences: fast Fourier versus fast Hartley transform algorithms
Author:
- P.R. UniyalPUP.R. Uniyal
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 42 (11) , 3249-3254
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A second improved digit-reversal permutation algorithm for fast transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Real-valued fast Fourier transform algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- The Fast Hartley Transform AlgorithmIEEE Transactions on Computers, 1987
- A comparison of the time involved in computing fast Hartley and fast Fourier transformsProceedings of the IEEE, 1985
- Fast Fourier Transform and Convolution Algorithms1982
- z-transform DFT filters and FFT'sIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- Algorithm AS 97: Real Discrete Fast Fourier TransformJournal of the Royal Statistical Society Series C: Applied Statistics, 1976
- The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transformsJournal of Sound and Vibration, 1970
- On computing the fast Fourier transformCommunications of the ACM, 1967