首页 | 本学科首页   官方微博 | 高级检索  
     

一种利用本原元的快速RS码盲识别算法
引用本文:王平,曾伟涛,陈健,陆继翔. 一种利用本原元的快速RS码盲识别算法[J]. 西安电子科技大学学报(自然科学版), 2013, 40(1): 105-110,168. DOI: 10.3969/j.issn.1001-2400.2013.01.019
作者姓名:王平  曾伟涛  陈健  陆继翔
作者单位:西安电子科技大学通信工程学院;西北工业大学机电学院
基金项目:高等学校学科创新引智计划资助项目(B08038)
摘    要:建立了一种RS码编码参数的盲识别新方法.该方法利用本原元的校检作用并行搜索码长和域,提高了盲识别的效率;略掉不符合本原元校检的码字,增强了码根搜寻的可靠性;利用码根的连续性采用前进-倒退法搜索生成多项式,简化计算,提高了搜索速度.仿真结果表明,新算法在90%识别率的误比特率上限上有明显提高.

关 键 词:RS码  信道编码  盲识别  本原域元素
收稿时间:2012-08-29

Fast blind recognition algorithm for RS codes by primitive element
WANG Ping,ZENG Weitao,CHEN Jian,LU Jixiang. Fast blind recognition algorithm for RS codes by primitive element[J]. Journal of Xidian University, 2013, 40(1): 105-110,168. DOI: 10.3969/j.issn.1001-2400.2013.01.019
Authors:WANG Ping  ZENG Weitao  CHEN Jian  LU Jixiang
Affiliation:(1. School of Telecommunication Engineering, Xidian Univ., Xi'an  710071, China;2. School of Mechanical Eng., Northwestern Polytechnical Univ., Xi'an  710072, China)
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.
Keywords:Reed-Solomon codes  channel coding  blind recognition  primitive element  
本文献已被 CNKI 等数据库收录!
点击此处可从《西安电子科技大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《西安电子科技大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号