Fast DFT algorithms for length N=q*2/sup m/
Authors:
- Guoan BiGBGuoan Bi
- Yan Qiu ChenYCYan Qiu Chen
- 1 June 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 (6) , 685-690
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Radix-K FFT's using K-point convolutionsIEEE Transactions on Signal Processing, 1994
- Split-radix algorithms for length-p/sup m/ DFT'sIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Real-valued fast Fourier transform algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- A new FFT algorithm of radix 3,6, and 12IEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- On computing the split-radix FFTIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986