| 摘要: |
| 为解决高码率RS（Reed Solomon）码盲识别问题，提出了一种基于伽罗华域高斯列消元法的RS码盲识别方法。先利用矩阵秩的差值函数识别符号数及码长；再遍历此时符号数对应的本原多项式，对矩阵进行伽罗华域高斯列消元，并引入熵函数差值来识别本原多项式；最后求码字多项式的根，其中连续根即为生成多项式的根。该方法可以较好地识别RS码码长、生成多项式及本原多项式，并且避免了遍历符号数时多次进行伽罗华域傅里叶变换的繁琐过程。仿真结果表明，在误码率为3×10－3的情况下，对RS码的识别概率高于90%。 |
| 关键词: RS码；盲识别 伽罗华域；高斯列消元法 |
| DOI： |
|
| 基金项目:国家自然科学基金资助项目(61371164，61071196，61102131)；信号与信息处理重庆市市级重点实验室建设项目(CSTC2009CA2003)；重庆市杰出青年基金项目(CSTC2011jjjq40002);重庆市自然科学基金资助项目(CSTC2012JJA4008)；重庆市教育委员会科研项目（KJ20525，KJ130524） |
|
| Blind recognition of RS codes based on Galois field columns Gaussian elimination |
| LI Can,ZHANG Tian-qi,LIU Yu |
| () |
| 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 eliminated with columns in Galois field.By using the difference of entropy,the primitive polynomial is identified.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 method.The tedious process of Galois field Fourier transform is avoided.Simulation results show that the recognition probability is higher than 90% at an error code rate of 3×10－3. |
| Key words: RS codes blind recognition Galois field columns Gaussian elimination |
《电讯技术》编辑部 