The discrete Fourier transform over a finite field with reduced multiplicative complexity

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI:10.1109/ISIT.2011.6033725

Sergei V. Fedorenko

引用次数: 9

Abstract

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.

查看原文本刊更多论文

有限域上的离散傅里叶变换，具有降低的乘法复杂度

提出了一种计算有限域离散傅里叶变换的新方法，降低了乘法复杂度。证明了Goertzel算法与环切算法的乘法复杂度重合定理。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2011 IEEE International Symposium on Information Theory Proceedings

自引率

0.00%

发文量