Efficient moving-window DFT algorithms
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
- Vol. 45 (2) , 256-260
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Discrete Fourier transform computation for digital relayingInternational Journal of Electrical Power & Energy Systems, 1994
- A comparative review of real and complex Fourier-related transformsProceedings of the IEEE, 1994
- Moving discrete fourier transformIEE Proceedings F Radar and Signal Processing, 1992
- An efficient FFT algorithm based on the discrete sine transformIEEE Transactions on Signal Processing, 1991
- Recursive real-time calculation of basic waveforms of signalsIEE Proceedings C Generation, Transmission and Distribution, 1991
- Recursive moving window DFT algorithmIEEE Transactions on Computers, 1990
- Real-valued fast Fourier transform algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Simple FFT and DCT algorithms with reduced number of operationsSignal Processing, 1984
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965