This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Pipeline Design of a Fast Prime Factor DFT on a Finite Field
March 1988 (vol. 37 no. 3)
pp. 266-273
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

[1] I. J. Good, "The interaction algorithm and practical Fourier analysis,"J. Royal Statist. Soc., Ser. B, vol. 20, pp. 361-372, 1958, "Addendum," vol. 22, MR 21 1674; MR 23 A4231, pp. 372-375, 1960.
[2] L. H. Thomas, "Using a computer to solve problems in physics," inApplications of Digital Computers. Boston, MA: Gion, 1963.
[3] D. P. Kolba and T. W. Parks, "A prime factor FFT algorithm using high-speed convolution,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, Aug. 1977.
[4] J.H. McClellan and C.M. Rader,Number Theory in Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
[5] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980, pp. 150-152.
[6] I. S. Reed, T. K. Truong, R. L. Miller, and J. P. Huang, "Fast transforms for decoding Reed-Solomon codes,"IEE Proc., vol. 128, pt. F, Feb. 1981.
[7] I. S. Reed and T. K. Truong, "The use of finite fields to compute convolutions,"IEEE Trans. Inform. Theory, vol. IT-21, Mar. 1975.
[8] H. J. Nassbaumer, "Digital filtering using complex Mersenne transforms,"IBM J. Res. Develop., vol. 20, Sept. 1976.

Index Terms:
pipeline design; fast prime factor DFT; finite field; Winograd type; pipeline structure; cyclic convolutions; complex numbers; Reed-Solomon codes; codes; Fourier transforms; pipeline processing.
Citation:
T.K. Truong, I.S. Reed, I.-S. Hsu, H.-C. Shyu, H.M. Shao, "A Pipeline Design of a Fast Prime Factor DFT on a Finite Field," IEEE Transactions on Computers, vol. 37, no. 3, pp. 266-273, March 1988, doi:10.1109/12.2163
Usage of this product signifies your acceptance of the Terms of Use.