国防科技大学学报2011，Vol.33Issue(4)：123-127,5.
一种RS码快速盲识别方法
A Fast Blind Recognition Method of RS Coding
吕喜在 1苏绍璟 1黄芝平1
作者信息
- 1. 国防科技大学机电工程与自动化学院,湖南长沙410073
- 折叠
摘要
Abstract
In aider Id 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 (GUT) of RS codes using the possible primitive polynomials. The results of experiments and performance analysis show that this method can blind recognize the RS coding of the great mass of unknown lines, and can obviously reduce the number of primitive polynomials searched in the recognition compared with the existing algorithms.关键词
RS码/有限域/多项式根/本原多项式/盲识别Key words
RS codes/ finite fields/ polynomial roots/ primitive polynomial/ blind recognition分类
信息技术与安全科学引用本文复制引用
吕喜在,苏绍璟,黄芝平..一种RS码快速盲识别方法[J].国防科技大学学报,2011,33(4):123-127,5.
