J4 ›› 2013, Vol. 40 ›› Issue (1): 105-110+168.doi: 10.3969/j.issn.1001-2400.2013.01.019

• Original Articles • Previous Articles     Next Articles

Fast blind recognition algorithm for RS codes by primitive element

WANG Ping1;ZENG Weitao1;CHEN Jian1;LU Jixiang2   

  1. (1. School of Telecommunication Engineering, Xidian Univ., Xi'an  710071, China;
    2. School of Mechanical Eng., Northwestern Polytechnical Univ., Xi'an  710072, China)
  • Received:2012-08-29 Online:2013-02-20 Published:2013-03-28
  • Contact: WANG Ping E-mail:pingwang@mail.xidian.edu.cn

Abstract:

A new algorithm is presented to solve RS code blind recognition problems. By searching the code length and the field parallelly based on the parith check function of the primitive element, the recognition efficiency is improved. The reliability of roots' searching is promoted by omitting error contained code words which do not accord with the primitive element parith check. The generator polynomial is forward-backward searched using the continuity of roots to simplify calculations and accelerate the search speed. Simulation results indicate that the new algorithm's upper limit of BER when correct recognition rate is 90% has a significant increase.

Key words: Reed-Solomon codes, channel coding, blind recognition, primitive element