作者: 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.