A conventional prime factor discrete Fourier transform (DFT) algorithm of the Winograd type is used to realize a discrete Fourier-like transform on the finite field GF(qn ). A pipeline structure is used to implement this prime-factor DFT over GF(qn). This algorithm is developed to compute cyclic convolutions of complex numbers and to aid in decoding the Reed-Solomon codes. Such a pipeline fast prime-factor DFT algorithm over GF(qn) is regular, simple, expandable, and naturally suitable for most implementation technologies. An example illustrating the pipeline aspect of a 30-point transform over GF(q n) is presented
Published in:
Computers, IEEE Transactions on
(Volume:37
,
Issue:
3
)
Date of Publication:
Mar 1988
- Page(s):
-
266
-
273
- ISSN :
-
0018-9340
- INSPEC Accession Number:
-
3133054
- Digital Object Identifier :
-
10.1109/12.2163
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Mar 1988
- Sponsored by :
-
IEEE Computer Society