The new method for the discrete Fourier transform computation over a finite field is introduced. This method is a nontrivial generalization of the Duhamel-Hollmann algorithm with replacement of the Toeplitz convolution calculation by the normalized cyclic convolution calculation. Both algorithms have the smallest multiplicative complexity.

中文翻译：

---

有限域上最小乘法复杂度的类Duhamel/Hollmann离散傅立叶变换算法


介绍了有限域上离散傅里叶变换计算的新方法。该方法是 Duhamel-Hollmann 算法的重要推广，用归一化循环卷积计算代替了 Toeplitz 卷积计算。两种算法都具有最小的乘法复杂度。