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

被引：0
|
作者：
Fedorenko, Sergei V. [1 ]
机构：
[1] St Petersburg State Univ Aerosp Instrumentat, Informat Syst Secur Dept, St Petersburg 190000, Russia
来源：
2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2011年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：1200 / 1204
页数：5
相关论文
共 50 条
12345