Open AccessBlind recognition of binary BCH codes based on Euclidean algorithm
Author(s) -
Yu Ming,
Zheng Feifei,
Ma Junwei,
Zhang Jingying
Publication year - 2020
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2020.1976
Subject(s) - bch code , euclidean algorithm , algorithm , code word , polynomial code , euclidean distance , binary number , mathematics , polynomial , euclidean geometry , berlekamp–welch algorithm , computer science , linear code , error detection and correction , arithmetic , block code , decoding methods , artificial intelligence , mathematical analysis , geometry
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.