点击次数：

论文类型：期刊论文

发表时间：2021-01-10

发表刊物：ELECTRONICS LETTERS

卷号：56

期号：21

页面范围：1154-+

ISSN号：0013-5194

关键字：polynomials; binary codes; BCH codes; computational complexity; geometry; iterative methods; Euclidean algorithm; blind recognition; binary Bose-Chaudhuri-Hocquenghem codes; noncooperative applications; iterative Euclidean divisions; demodulator output bit-stream; codeword length; generator polynomial; unknown BCH code; binary BCH codes; computational complexity

摘要：A novel method based on Euclidean algorithm is proposed to solve the problem of blind recognition of binary Bose-Chaudhuri-Hocquenghem (BCH) codes in non-cooperative applications. By carrying out iterative Euclidean divisions on the demodulator output bit-stream, the proposed method can determine the codeword length and generator polynomial of unknown BCH code. The computational complexity is derived asO(n(3)). Simulation results show the efficiency of the proposed method.