Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
- 1 August 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 32 (4) , 750-761
- https://doi.org/10.1109/tassp.1984.1164395
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A (Micro) Programmable Digital Image Processing SystemPublished by SPIE-Intl Soc Optical Eng ,1983
- An in-place, in-order prime factor FFT algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- A new radix-6 FFT algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- Fast Fourier Transform and Convolution AlgorithmsPublished by Springer Nature ,1981
- Fast polynomial transform algorithms for digital convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- z-transform DFT filters and FFT'sIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Speed enhancement of digital signal processing software via microprogramming a general purpose minicomputerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965