Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1265983 |
Changed an Item |
||
Property / author | |||
Property / author: Pei-de Chen / rank | |||
Normal rank |
Revision as of 21:21, 22 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) |
scientific article |
Statements
Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (English)
0 references
5 December 2005
0 references
This paper proposes a recursive algorithm to compute DFT (Discrete Fourier Transform) transforms over \(\text{GF}(2^m)\) for longer transform lengths \(2^m-1\), where \(8\leq m\leq 10\) when the transform length is a prime integer. The algorithm has been obtained in combination of the modified Winograd algorithm for computing cyclic convolutions with the extended fast prime-factor DFT algorithm developed earlier by the authors. The complexity of 255-, 511-, and 1023-point transforms over \(\text{GF}(2^m)\) is compared to existing efficient algorithms. It is also shown that the proposed algorithm requires fewer operations than those of the conventional methods.
0 references
Reed-Solomon codes
0 references
cyclic convolution
0 references
Winograd algorithm
0 references
DFT algorithm
0 references