Fast, prime factor, discrete Fourier transform algorithms over GF(2m) for 8≤m≤10

  • Authors:

  • T. K. Truong;P. D. Chen;L. J. Wang;Y. Chang;I. S. Reed

  • Affiliations:

  • Department of Information Engineering, I-Shou University, 1, Section 1, Hsueh-Cheng Rd, Ta-Hsu Hsiang, Koahsiung County 84008, Taiwan;Department of Information Engineering, I-Shou University, 1, Section 1, Hsueh-Cheng Rd, Ta-Hsu Hsiang, Koahsiung County 84008, Taiwan;Department of Information Technology, National Pingtung Institute of Commerce, Pingtung 900, Taiwan;Department of Information Engineering, I-Shou University, 1, Section 1, Hsueh-Cheng Rd, Ta-Hsu Hsiang, Koahsiung County 84008, Taiwan;Department of Electrical Engineering-Systems, EEB 500, University of Southern California, Los Angeles, CA 90089-2565, USA

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2006

Quantified Score

Hi-index 0.08

Visualization

Abstract

In this paper it is shown that Winograd's algorithm for computing convolutions and a fast, prime factor, discrete Fourier transform (DFT) algorithm can be modified to compute Fourier-like transforms of long sequences of 2^m-1 points over GF(2^m), for 8=