The generalized Goertzel algorithm and its parallel hardware implementation

作者: Hao Chen , GongLiang Chen , JianHua Li

DOI: 10.1007/S11425-007-0183-4

关键词:

摘要: Reed-Solomon (RS) and Bose-Chaudhuri-Hocquenghem (BCH) error correcting codes are widely used in digital technology. An important problem the implementation of RS BCH decoding is fast finding positions (the roots locator polynomials). Several root-finding algorithms for polynomials over finite fields have been proposed. In this paper we give a generalization Goertzel algorithm. Our algorithm suitable parallel hardware time multiplications restricted by constant.

参考文章(12)
Elwyn R. Berlekamp, Algebraic Coding Theory ,(1984)
E.R. Berlekamp, H. Rumsey, G. Solomon, On the solution of algebraic equations over finite fields Information & Computation. ,vol. 10, pp. 553- 564 ,(1967) , 10.1016/S0019-9958(67)91016-9
Robert J. McEliece, Mark Kac, The theory of information and coding : a mathematical framework for communication Addison-Wesley Pub. Co., Advanced Book Program. ,(1977)
R. Chien, B. Cunningham, I. Oldham, Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.) IEEE Transactions on Information Theory. ,vol. 15, pp. 329- 335 ,(1969) , 10.1109/TIT.1969.1054283
T.-K. Truong, J.-H. Jeng, I.S. Reed, Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders IEEE Transactions on Communications. ,vol. 49, pp. 779- 783 ,(2001) , 10.1109/26.923801
S.V. Fedorenko, P.V. Trifonov, Finding roots of polynomials over finite fields IEEE Transactions on Communications. ,vol. 50, pp. 1709- 1711 ,(2002) , 10.1109/TCOMM.2002.805269
R. Chien, Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes IEEE Transactions on Information Theory. ,vol. 10, pp. 357- 363 ,(1964) , 10.1109/TIT.1964.1053699