Additive fast fourier transforms over finite fields

IEEE Transactions on Information Theory

Volumn 56, Issue 12, 2010, Pages 6265-6272

  Gao, Shuhong ^a   Mateer, Todd ^b  

^a CLEMSON UNIVERSITY   (United States)

^b Howard Community College   (United States)

Author keywords

convolution; Fast Fourier transform (FFT); multiplication; Reed Solomon codes; Taylor expansion

Indexed keywords

FAST FOURIER TRANSFORM ALGORITHM; FINITE FIELDS; MULTIPLICATION; TAYLOR EXPANSIONS;

CODES (SYMBOLS); CONVOLUTION; EXPANSION; FINITE ELEMENT METHOD; REED-SOLOMON CODES; SIGNAL RECEIVERS;

FAST FOURIER TRANSFORMS;

EID: 78649380534     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2079016     Document Type: Article

References (18)

1. J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comput., vol. 19, pp. 297-301, 1965.
2. J. S. Walker, "Fast Fourier Transforms," in Studies in Advanced Mathematics, 2nd ed. Boca Raton, FL: CRC, 1996.
3. I. S. Reed and G. Solomon, "Polynomial codes over certain finite fields," J. Soc. Indust. Appl. Math., vol. 8, pp. 300-304, 1960.
4. S. Gao, "A new algorithm for decoding Reed-Solomon codes," in Communications, Information and Network Security, V. Bhargava, H. V. Poor, V. Tarokh, and S. Yoon, Eds. Norwell, MA: Kluwer, 2003, vol. 712, pp. 55-68.
5. A. Shiozaki, "Decoding of redundant residue polynomial codes using Euclid's algorithm," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 1351-1354, Sep. 1988.
6. Y. Wang and X. Zhu, "Afast algorithm for Fourier transform over finite fields and its VLSI implementation," IEEE J. Sel. Areas Commun., vol. 6, no. 3, Apr. 1988.
7. D. G. Cantor, "On arithmetical algorithms overfinitefields," J. Combin. Theory, ser. A, vol. 50, no. 2, pp. 285-300, 1989.
8. 2," in Proc. 1997 Int. Symp. Symbolic and Algebraic Computation, ISSAC'96, Y. N. Lakshman, Ed., Zurich, Switzerland [Online]. Available: http://www-math.uni-paderborn.de/aggathen/Publications/ polyfactTR.ps, ACM Press. Technical report tr-rsfb-96-018, University of Paderborn, Germany, 1996, 43 pages
9. A. Schönhage, "Schnelle multiplikation von polynomen über kör-pern der charakteristik 2," Acta Informat. vol. 7, no. 4, 1976/77, pp. 395-398.
10. T. D. Mateer, "Fast Fourier Transform Algorithms With Applications" Ph.D. dissertation, Clemson Univ., Clemson, SC [Online]. Available: http://cr.yp.to/f2mult.html
11. T. D. Mateer, "Simple Algorithms for Decoding Systematic Reed-Solomon Codes," in preparation.
12. P. V. Trifonov and S. V. Fedorenko, "A method for fast computation of the Fourier transform over a finite field," Probl. Inform. Transm., vol. 39, no. 3, pp. 231-238, 2003, Translation of Problemy Peredachi Informatsii.
13. E. Costa, S. V. Fedorenko, and P. V. Trifonov, "On computing the syndrome polynomial in Reed-Solomon decoder," Eur. Trans. Telecommunications, vol. 15, no. 4, pp. 337-342, 2004.
14. S. V. Fedorenko, "A method for computation of the discrete Fourier transform over a finite field," Probl. Inform. Transm., vol. 42, no. 2, pp. 139-151, 2006, Translation of Problemy Peredachi Informatsii.
15. S. V. Fedorenko, "On semifast Fourier transform algorithms," in Proc. XII Int. Symp. Problems of Redundancy in Information and Control Systems, St. Petersburg, Russia, May 2009, pp. 65-70 [Online]. Available: http://arxiv.org/abs/0907.1975
16. N. Chen and Z. Yan, "Cyclotomic FFTs with reduced additive complexities based on a novel common subexpression elimination algorithm," IEEE Trans. Signal Process., vol. 57, no. 3, pp. 1010-1020, Mar. 2009.
17. N. Chen and Z. Yan, "Reduced-complexity Reed-Solomon decoders based on cyclotomic FFTs," IEEE Signal Process. Lett., vol. 16, no. 4, pp. 279-282, Apr. 2009.
18. I. F. Blake, X. Gao, R. C. Mullin, S. A. Vanstone, and T. Yaghoobian, Applications of Finite Fields, A. J. Menezes, Ed. Boston/Dordrecht/Lancaster: Kluwer, 1993