Abstract：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.
甘露, 周攀. 基于中国剩余定理分解的RS码快速盲识别算法[J]. 电子与信息学报, 2012, 34(12): 2837-2842.
Gan Lu, Zhou Pan. Fast Blind Recognition Method of RS Codes Based on Chinese Remainder Theorem Decomposition. , 2012, 34(12): 2837-2842.
2012, Vol. 34 
