
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 266273, March, 1988.  
BibTex  x  
@article{ 10.1109/12.2163, author = {T.K. Truong and I.S. Reed and I.S. Hsu and H.C. Shyu and H.M. Shao}, title = {A Pipeline Design of a Fast Prime Factor DFT on a Finite Field}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {3}, issn = {00189340}, year = {1988}, pages = {266273}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.2163}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Pipeline Design of a Fast Prime Factor DFT on a Finite Field IS  3 SN  00189340 SP266 EP273 EPD  266273 A1  T.K. Truong, A1  I.S. Reed, A1  I.S. Hsu, A1  H.C. Shyu, A1  H.M. Shao, PY  1988 KW  pipeline design; fast prime factor DFT; finite field; Winograd type; pipeline structure; cyclic convolutions; complex numbers; ReedSolomon codes; codes; Fourier transforms; pipeline processing. VL  37 JA  IEEE Transactions on Computers ER   
[1] I. J. Good, "The interaction algorithm and practical Fourier analysis,"J. Royal Statist. Soc., Ser. B, vol. 20, pp. 361372, 1958, "Addendum," vol. 22, MR 21 1674; MR 23 A4231, pp. 372375, 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 highspeed convolution,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP25, Aug. 1977.
[4] J.H. McClellan and C.M. Rader,Number Theory in Digital Signal Processing. Englewood Cliffs, NJ: PrenticeHall, 1975.
[5] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: AddisonWesley, 1980, pp. 150152.
[6] I. S. Reed, T. K. Truong, R. L. Miller, and J. P. Huang, "Fast transforms for decoding ReedSolomon 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. IT21, Mar. 1975.
[8] H. J. Nassbaumer, "Digital filtering using complex Mersenne transforms,"IBM J. Res. Develop., vol. 20, Sept. 1976.