摘要
针对误码条件下的BCH码盲识别问题,提出了一种低复杂度的算法。现有的对BCH码的识别方法多采用通用的线性分组码识别方法,不能同时适用于码长较长、误码率较高时的情况。该算法基于BCH码是汉明码的子空间,通过汉明码的校验矩阵校验BCH码。识别内容包括码长、码字起点和生成多项式。仿真结果表明:对码长为1 023的BCH码,在误码率0.5%的条件下,仍能正确识别。
A low complexity method was proposed for the blind recognition of BCH codes under error conditions. The existing recognition methods most come from the generic methods of linear block codes, which can＇ t be applied when the code length is long and the bit error rate is high. This method is based on that the BCH codes come from the sub-space of Hamming codes, so the parity check matrix of the hamming codes can be used to check the BCH codes. The method contains recovering the code length, synchronization and generator polynomial. The simulations show that the algorithm runs successfully for a BCH code with length 1 023, when the bit error rate is 0.5%.
出处
《计算机应用》
CSCD
北大核心
2014年第12期3618-3620,3623,共4页
journal of Computer Applications
关键词
BCH码
汉明码
盲识别
生成多项式
BCH code
Hamming code
blind recognition
generator polynomial
