Additive Fast Fourier Transforms Over Finite Fields

201085 citationsJournal Article

Authors

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

Topics & Keywords

Coding theory and cryptography Digital Filter Design and Implementation Algorithms and Data Compression

Publication Details

Published in: IEEE Transactions on Information Theory

Volume 56, Issue 12, pp. 6265-6272

DOI: 10.1109/tit.2010.2079016

Field-Weighted Citation Impact: 4.25

Command Palette

Additive Fast Fourier Transforms Over Finite Fields

Authors

Abstract

Topics & Keywords

Publication Details