关键词: 信道编码, 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