| 一种RS码快速盲识别方法 |
| |
| 引用本文： | 吕喜在,苏绍璟,黄芝平.一种RS码快速盲识别方法[J].国防科技大学学报,2011,33(4):123-127. |
| |
| 作者姓名： | 吕喜在 苏绍璟 黄芝平 |
| |
| 作者单位： | 国防科技大学机电工程与自动化学院,湖南长沙,410073 |
| |
| 摘 要： | 为了获取数字通信中未知线路的纠错编码信息,提出了一种RS码快速盲识别方法.通过对RS码的二进制表示进行码根求解的方法来检测未知线路的RS码长、本原多项式阶数以及可能的本原多项式;进而遍历得到的本原多项式对RS序列进行伽罗华域的傅里叶变换(GFFT),通过连零位置和个数最终确定未知线路的真实本原多项式和生成多项式.实验验...
|
| 关 键 词： | RS码 有限域 多项式根 本原多项式 盲识别 |
| 收稿时间： | 2010/2/15 0:00:00 |
A Fast Blind Recognition Method of RS Coding |
| |
| LV Xizai,SU Shaojing and HUANG Zhiping.A Fast Blind Recognition Method of RS Coding[J].Journal of National University of Defense Technology,2011,33(4):123-127. |
| |
| Authors: | LV Xizai SU Shaojing and HUANG Zhiping |
| |
| Institution: | LV Xi-zai,SU Shao-jing,HUANG Zhi-ping(College of Mechatronics Engineering and Automation,National Univ.of Defense Technology,Changsha 410073,China) |
| |
| Abstract: | In order to get the error-correcting coding information of the unknown lines in digital communication,a fast blind recognition method of Reed-Solomon(RS) coding is presented.RS coding length,the order of the primitive polynomial and the possible primitive polynomials were detected by seeking the roots of binary form of RS codes.The true primitive polynomial and generator polynomial of the unknown line were gained by the position and number of the connective zeros in the Galois Fields Fourier Transform(GFFT)... |
| |
| Keywords: | RS codes finite fields polynomial roots primitive polynomial blind recognition |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
