Efficient computation of the DFT with only a subset of input or output points
- 1 March 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 41 (3) , 1184-1200
- https://doi.org/10.1109/78.205723
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- A new efficient algorithm for computing a few DFT pointsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Real-valued fast Fourier transform algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Method for partial spectrum computationIEE Proceedings F Communications, Radar and Signal Processing, 1987
- Pruning the decimation-in-time FFT algorithm with frequency shiftIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- On computing the split-radix FFTIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- High-resolution narrow-band spectra by FFT pruningIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- FFT algorithm for both input and output pruningIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- Pruning the decimation in-time FFT algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- An algorithm for computing the mixed radix fast Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965