Improving the Goertzel–Blahut Algorithm
Sergei Valentinovich Fedorenko · IEEE Signal Processing Letters · 2016
A novel method for computing the discrete Fourier transform (DFT) over a finite field based on the Goertzel-Blahut algorithm is described. The novel method is currently the best one for computing the DFT over even extensions of the characteristic two finite field, in terms of multiplicative complexity.