Release Time:2021-03-23  Hits:

Indexed by: Journal Article

Date of Publication: 2021-01-10

Journal: ELECTRONICS LETTERS

Volume: 56

Issue: 21

Page Number: 1154-+

ISSN: 0013-5194

Key Words: 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

Abstract: 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.