Issue No. 03 - March (1978 vol. 27)
ISSN: 0018-9340
pp: 283-285
D.V. Sarwate , Coordinated Science Laboratory and the Department of Electrical Engineerig, University of Illinois
ABSTRACT
An algorithm which computes the Fourier transform of a sequence of length n over GF(2<sup>m</sup>) using approximately 2nm multiplications and n<sup>2</sup>+ nm additions is developed. The number of multiplications is thus considerably smaller than the n<sup>2</sup>multiplications required for a direct evaluation, though the number of additions is slightly larger. Unlike the fast Fourier transform
INDEX TERMS
Fourier transforms, Analysis of algorithms, computational complexity, error-correcting codes, finite fields
CITATION

D. Sarwate, "Semi-Fast Fourier Transforms over GF(2<sup>m</sup>).," in IEEE Transactions on Computers, vol. 27, no. , pp. 283-285, 1978.
doi:10.1109/TC.1978.1675088