Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric data
- 23 March 2005
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- 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
- Existence of a 2n FFT algorithm with a number of multiplications lower than 2n+1Electronics Letters, 1984
- Very fast computation of the radix-2 discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- Fast Fourier Transform and Convolution AlgorithmsSpringer Series in Information Sciences, 1981
- Automatic generation of time efficient digital signal processing softwareIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A new principle for fast Fourier transformationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- A fast Fourier transform algorithm for symmetric real-valued seriesIEEE Transactions on Audio and Electroacoustics, 1972
- Numerical Analysis: A fast fourier transform algorithm for real-valued seriesCommunications of the ACM, 1968