An efficient prime-length DFT algorithm over finite fields GF(2m)

This letter describes a discrete Fourier transform (DFT) for prime transform lengths N greater than or equal to 3, where the sample values are elements of finite (Galois) fields GF(2(m)). A regular and uniform system of additions and multiplications is presented which reduces the multiplicative complexity by at least one-quarter, compared with a brute-force implementation. The benefits of the algorithm are shown with respect to BCH decoding; in particular, the efficient computation of syndromes will be discussed. Copyright (C) 2003 AEI.