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

• 研究论文 • 上一篇    下一篇

一种利用本原元的快速RS码盲识别算法

王平1;曾伟涛1;陈健1;陆继翔2   

  1. (1. 西安电子科技大学 通信工程学院,陕西 西安  710071;
    2. 西北工业大学 机电学院,陕西 西安  710072)
  • 收稿日期:2012-08-29 出版日期:2013-02-20 发布日期:2013-03-28
  • 作者简介:王平(1978-),女,讲师,E-mail: pingwang@mail.xidian.edu.cn.
  • 基金资助:

    高等学校学科创新引智计划资助项目(B08038)

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

摘要:

建立了一种RS码编码参数的盲识别新方法.该方法利用本原元的校检作用并行搜索码长和域,提高了盲识别的效率;略掉不符合本原元校检的码字,增强了码根搜寻的可靠性; 利用码根的连续性采用前进-倒退法搜索生成多项式,简化计算,提高了搜索速度.仿真结果表明,新算法在90%识别率的误比特率上限上有明显提高.

关键词: RS码, 信道编码, 盲识别, 本原域元素

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