Abstract: The Cooley-Tukey FFT algorithm decomposes a discrete Fourier transform (DFT) of size n = km into smaller DFT of size k and m. In this paper we present a theorem that decomposes a polynomial ...
Though the FFT algorithm is brilliant---both extremely fast and efficient---it is still limited by the size of the computer's memory. But we can extend the standard Cooley-Tukey algorithm to work on ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results