Citation
Abstract
In this article, a conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite field, GF(q” ). A pipeline structure is used to implement this prime factor DFT over GF(q"). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode Reed-Solomon codes. Such a pipeline fast prime factor DFT algorithm over GF(q") is regular, simple, expandable, and naturally suitable for VLSI implementation. An example illustrating the pipeline aspect of a 30-point transform over GF(q") is presented. GF(q"). GF(Q").
Details
- Volume
- 42-85
- Published
- May 15, 1986
- Pages
- 42–52
- File Size
- 740.0 KB