西安电子科技大学学报

• 研究论文 • 上一篇    下一篇

二进制缩短BCH码识别新方法

刘杰;张立民;方君   

  1. (海军航空大学 信息融合研究所,山东 烟台 264001)
  • 收稿日期:2016-12-20 出版日期:2017-12-20 发布日期:2018-01-18
  • 通讯作者: 张立民(1966-),男,教授,E-mail: iamzlm@163.com
  • 作者简介:刘杰(1990-),男,海军航空大学学院博士研究生,E-mail: iamliu1573@163.com.
  • 基金资助:

    国家自然科学基金重大研究计划资助项目(91538201);泰山学者工程专项经费资助项目(st201511020)

New recognition method for binary shortened BCH codes

LIU Jie;ZHANG Limin;FANG Jun   

  1. (Inst. of Information Fusion, Naval Aeronautical Univ., Yantai 264001, China)
  • Received:2016-12-20 Online:2017-12-20 Published:2018-01-18

摘要:

针对现有识别方法仅适用于本原BCH码的问题,提出了一种软判决条件下的缩短BCH码识别方法.首先,根据软判决信息由对应硬判决序列建立分析矩阵;然后,通过矩阵高斯列消元,并建立二元假设检验,对码长进行判决.在此基础上,构建本原BCH码,在不同本原多项式下利用软判决信息对校验矩阵进行验证,得到生成多项式的根分布,最终完成本原多项式和生成多项式的识别.该方法不仅能识别缩短BCH码,也适用于本原BCH码.仿真试验证明了该方法的有效性,对本原BCH码的识别结果表明,该方法的性能优于传统识别方法.

关键词: 信道编码, BCH码, 软判决, 高斯列消元, 校验矩阵

Abstract:

Current recognition methods are mainly aimed at primitive BCH codes. To solve this problem, a novel recognition method based on soft decision is proposed for binary shortened BCH codes. According to the soft decision information, an analysis matrix is established by the hard decision sequence. The Gauss elimination algorithm is applied to the matrix, and a binary hypothesis test is built to recognize the code length. Then, a primitive BCH code is constructed, and a parity-check matrix is tested under different primitive polynomials by using the soft decision information. Finally, the primitive polynomial and generator polynomial are recognized according to the roots distribution of the generator polynomial. The proposed method is effective for both shortened BCH codes and primitive BCH codes. Simulations verify the applicability of the proposed method. The recognition results of primitive BCH codes show that the proposed method performs better than the conventional recognition methods.

Key words: channel coding, BCH codes, soft decision, Gauss elimination, parity-check matrix