The discrete Fourier transform over a finite field with reduced multiplicative complexity
Sergei Valentinovich Fedorenko · 2011
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. The theorem about the multiplicative complexity coincidence of the Goertzel and cyclotomic algorithms is proved.