Blind Recognition of RS Codes Based on Galois Field Columns Gaussian Elimination
Author(s): LI Can, ZHANG Tian-qi, LIU Yu
Pages: 66-71
Year: 2014 Issue: 7
Journal: Telecommunication Engineering
Keyword: RS codes; blind recognition; Galois field; columns Gaussian elimination;
Abstract: In order to solve the blind recognition problem of the high rate Reed Solomon(RS) codes,this paper presents a blind recognition method based on Galois Field columns Gaussian elimination. Firstly,code length and symbolic number are recognized by using the difference function of the matrix rank. Then the primitive polynomials corresponding to the number of symbol at this time are traversed. And the matrix is e-liminated with columns in Galois field. By using the difference of entropy,the primitive polynomial is identi-fied. Finally,as the code word polynomial roots are found,the continuous roots are the roots of the generator polynomial. Code length,the primitive polynomial and the generator polynomial are identified by the meth-od. The tedious process of Galois field Fourier transform is avoided. Simulation results show that the recog-nition probability is higher than 90% at an error code rate of 3×10-3 .
Pages: 66-71
Year: 2014 Issue: 7
Journal: Telecommunication Engineering
Keyword: RS codes; blind recognition; Galois field; columns Gaussian elimination;
Abstract: In order to solve the blind recognition problem of the high rate Reed Solomon(RS) codes,this paper presents a blind recognition method based on Galois Field columns Gaussian elimination. Firstly,code length and symbolic number are recognized by using the difference function of the matrix rank. Then the primitive polynomials corresponding to the number of symbol at this time are traversed. And the matrix is e-liminated with columns in Galois field. By using the difference of entropy,the primitive polynomial is identi-fied. Finally,as the code word polynomial roots are found,the continuous roots are the roots of the generator polynomial. Code length,the primitive polynomial and the generator polynomial are identified by the meth-od. The tedious process of Galois field Fourier transform is avoided. Simulation results show that the recog-nition probability is higher than 90% at an error code rate of 3×10-3 .
Related Articles