The Community for Technology Leaders
Green Image
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(q/sup /n). A pipeline structure is used to implement this prime-factor DFT over GF(q/sup /n). This algorithm is developed to compute cyclic convolutions of complex numbers and to aid in decoding the Reed-Solomon codes. Such a pip
pipeline design; fast prime factor DFT; finite field; Winograd type; pipeline structure; cyclic convolutions; complex numbers; Reed-Solomon codes; codes; Fourier transforms; pipeline processing.

T. Truong, H. Shyu, I. Hsu, I. Reed and H. Shao, "A Pipeline Design of a Fast Prime Factor DFT on a Finite Field," in IEEE Transactions on Computers, vol. 37, no. , pp. 266-273, 1988.
88 ms
(Ver 3.3 (11022016))