Additive Fast Fourier Transforms Over Finite Fields

被引：48

作者：

Gao, Shuhong ^{[1
]}

Mateer, Todd ^{[2
]}

机构：

[1] Clemson Univ, Dept Math Sci, Clemson, SC 29634 USA

[2] Howard Community Coll, Div Math, Columbia, MD 21044 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2010年 / 56卷 / 12期

基金：

美国国家科学基金会;

关键词：

Fast Fourier transform (FFT); Taylor expansion; multiplication; convolution; Reed-Solomon codes; POLYNOMIAL CODES; COMPUTATION;

D O I：

10.1109/TIT.2010.2079016

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present new additive Fast Fourier Transform (FFT) algorithms based on Taylor expansions over finite fields of characteristic two. The new algorithms improve previous approaches by Wang and Zhu (1988), Cantor (1989), and von zur Gathen and Gerhard (1996).

引用

页码：6265 / 6272

页数：8

共 19 条

[1]

[Anonymous], 2003, Modern Computer Algebra

[2]

BLAKE IF, 1993, APPL FINITE FIELDS

[3] ON ARITHMETICAL ALGORITHMS OVER FINITE-FIELDS [J].