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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results