二进制缩短BCH码识别新方法
发布时间：2018-09-10 11:58
【摘要】：针对现有识别方法仅适用于本原BCH码的问题,提出了一种软判决条件下的缩短BCH码识别方法.首先,根据软判决信息由对应硬判决序列建立分析矩阵;然后,通过矩阵高斯列消元,并建立二元假设检验,对码长进行判决.在此基础上,构建本原BCH码,在不同本原多项式下利用软判决信息对校验矩阵进行验证,得到生成多项式的根分布,最终完成本原多项式和生成多项式的识别.该方法不仅能识别缩短BCH码,也适用于本原BCH码.仿真试验证明了该方法的有效性,对本原BCH码的识别结果表明,该方法的性能优于传统识别方法.
[Abstract]:In order to solve the problem that the existing recognition methods are only applicable to the original BCH codes, a method for the recognition of shortened BCH codes under soft decision conditions is proposed. First, the analysis matrix is established from the corresponding hard decision sequence according to the soft decision information, and then, the code length is determined by the matrix elimination of the Goliath element, and the binary hypothesis test is established. On this basis, the primitive BCH codes are constructed, the check matrix is verified by soft decision information under different primitive polynomials, the root distribution of the generated polynomials is obtained, and the recognition of primitive polynomials and generating polynomials is finally completed. This method can not only recognize the shortened BCH code, but also be suitable for the original BCH code. The simulation results show that the method is effective and the performance of the method is better than that of the traditional BCH code recognition method.
【作者单位】： 海军航空大学信息融合研究所;
【基金】：国家自然科学基金重大研究计划资助项目(91538201) 泰山学者工程专项经费资助项目(st201511020)
【分类号】：TN911.22
，
本文编号：2234376
[Abstract]:In order to solve the problem that the existing recognition methods are only applicable to the original BCH codes, a method for the recognition of shortened BCH codes under soft decision conditions is proposed. First, the analysis matrix is established from the corresponding hard decision sequence according to the soft decision information, and then, the code length is determined by the matrix elimination of the Goliath element, and the binary hypothesis test is established. On this basis, the primitive BCH codes are constructed, the check matrix is verified by soft decision information under different primitive polynomials, the root distribution of the generated polynomials is obtained, and the recognition of primitive polynomials and generating polynomials is finally completed. This method can not only recognize the shortened BCH code, but also be suitable for the original BCH code. The simulation results show that the method is effective and the performance of the method is better than that of the traditional BCH code recognition method.
【作者单位】： 海军航空大学信息融合研究所;
【基金】：国家自然科学基金重大研究计划资助项目(91538201) 泰山学者工程专项经费资助项目(st201511020)
【分类号】：TN911.22
，
本文编号：2234376
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2234376.html
