Split-radix algorithms for length-p/sup m/ DFT's
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 37 (1) , 57-64
- https://doi.org/10.1109/29.17500
Abstract
The split-radix algorithm for the discrete Fourier transform (DFT) of length-2/sup m/ is considered. First, the reason why the split-radix algorithm is better than any single-radix algorithm on length-2/sup m/ DFTs is given. Then, the split-radix approach is generalized to length-p/sup m/ DFTs. It is shown that whenever a radix-p/sup 2/ outperforms a radix-p algorithm, then a radix-p/p/sup 2/ algorithm will outperform both of them. As an example, a radix-3/9 algorithm is developed for length-3/sup m/ DFTs.Keywords
This publication has 17 references indexed in Scilit:
- Real-valued fast Fourier transform algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- 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
- Simple FFT and DCT algorithms with reduced number of operationsSignal Processing, 1984
- Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- ‘Split radix’ FFT algorithmElectronics Letters, 1984
- Fast Fourier Transform and Convolution AlgorithmsPublished by Springer Nature ,1982
- A new algorithm for the radix-3 FFTIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A new principle for fast Fourier transformationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976