Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric data
- 23 March 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 10, 784-787
- https://doi.org/10.1109/icassp.1985.1168332
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Existence of a 2
n
FFT algorithm with a number of multiplications lower than 2
n
+1
Electronics Letters, 1984
- 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
- Very fast computation of the radix-2 discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- Fast Fourier Transform and Convolution AlgorithmsPublished by Springer Nature ,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