Blind recognition of binary BCH codes based on Euclidean algorithm. Issue 21 (1st September 2020)

• Record Type: Journal Article
• Authors: Yu, Ming; Zheng, Feifei; Ma, Junwei; Zhang, Jingying
• Is Part Of: Electronics letters. Volume 56:Issue 21(2020)
• Page Start: 1154
• Page End: 1156
• Publication Date: 2020-09-01
• Subjects: 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; Electronics -- Periodicals; 621.381
• DOI: 10.1049/el.2020.1976
• Languages: English
• ISSNs: 0013-5194

Abstract

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 as O ( n 3 ). Simulation results show the efficiency of the proposed method.