基于中国剩余定理分解的RS码快速盲识别算法

该文提出一种新的RS (Reed Solomon)码盲识别方法。该方法利用RS码等效二进制准循环码的代数结构，将截获到的二进制码序列映射为环上的线性码，应用中国剩余定理(Chinese Remainder Theorem, CRT)将环上的线性码进行直和分解，计算不同码长下所有本原多项式对应分量码在相应码空间的归一化维数，通过寻找归一化维数的最小值，实现对RS码码长和本原多项式的识别；最后通过对码字进行因式分解识别RS码的生成多项式。该方法具有使用数据量少，运算量低等方面的特点。仿真结果表明，能完成在较高误码率的情况下对RS码的快速盲识别。

Fast Blind Recognition Method of RS Codes Based on Chinese Remainder Theorem Decomposition

Based on the property that the equivalent binary block codes of Reed-Solomon (RS) codes are quasi- cyclic codes, a new blind recognition method of RS codes is proposed. The intercepted binary sequence is regarded as linear codes over a ring. Then, the decomposition into component codes of equivalent codes is conducted by using the Chinese Reminder Theorem (CRT). By computing the normalized dimensions of the component codes over different fields and finding the minimum of them, the length and the primitive polynomial of the RS code are estimated. Finally the generator polynomial can be obtained by factoring the RS code words. The proposed method has lower computational complexity and uses less intercepted data than existing methods. Simulation results show that it has good performance even if with high BER situation.