Article

Additive Fast Fourier Transforms Over Finite Fields

Dept. of Math. Sci., Clemson Univ., Clemson, SC, USA
IEEE Transactions on Information Theory (impact factor: 3.01). 01/2011; DOI:10.1109/TIT.2010.2079016 pp.6265 - 6272
Source: IEEE Xplore

ABSTRACT 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).

0 0
 · 
0 Bookmarks
 · 
60 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

finite fields
 
Gerhard
 
new algorithms
 
Taylor expansions
 
von zur Gathen
 
Zhu
 

Shuhong Gao