Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform

In this paper, a new recursive algorithm for calculating the discrete Fourier transformation is presented. This new, so-called recursive cyclotomic factorization algorithm (RCFA) is more efficient than the fast Fourier transformation (FFT) algorithm. Moreover, due to its recursive nature, the RCFA can also be easily implemented, using only a limited number of different computation cells.