A soft decision based blind recognition(SDBR)method for primitive BCH codes is proposed to solve the problem that existing recognition methods have low error-resilient capabilities. Firstly
bit sequences as well as the corresponding reliability information are obtained by soft demodulation of the intercepted data
then code words are divided and a reliability coefficient of code roots is established with the reliability information to calculate the occurrence probability of code roots
and code length is estimated by using Kullback-Leibler divergence. Secondly
reliability statistics of common code roots are defined and a binary hypothesis test is built
then common code roots are verified under different primitive polynomials. Finally
the right primitive polynomial is recognized by using the continuous distribution characteristics of common code roots
and a generator polynomial is calculated from all these code roots. Simulation results show that the SDBR method effectively recognizes the commonly used primitive BCH codes when the signal-to-noise ratio is above 7 dB. A comparison with the roots information dispersion entropy based method shows that the SDBR method improves the error-resilient performance by 1.8 dB.
XIA T, WU H C. Joint blind frame synchronization and encoder identification for low-density parity-check codes [J]. IEEE Communication Letters, 2014, 18(2): 352-355.
CHEN W G, WU G Q. Blind recognition of (n-1)/n rate punctured convolutional encoders in a noisy environment [J]. Journal of Communications, 2015, 10(4): 260-267.
BRINGER J, CHABANNE H. Code reverse engineering problem for identification codes [J]. IEEE Transactions on Information Theory, 2012, 58(4): 2406-2412.
WANG Lanxun, LI Danfang, WANG Yang. Blind recognition of binary primitive BCH codes parameters [J]. Journal of Hebei University(Natural Science Edition), 2012, 41(6): 1166-1175.
YANG Xiaojing, WEN Niancheng. Recognition method of BCH codes based on roots information dispersion entropy and roots statistic [J]. Journal of Detection Control, 2010, 32(3): 69-73.
ZHOU J, HUANG Z P, SU S J, et al. Blind recognition of binary cyclic codes [J]. EURASIP Journal on Wireless Communication and Networking, 2013, 218: 1-17.
LI Xinhao, ZHANG Min. Linear code blind identification method based on code weight distribution and hamming distance [J]. Journal of Detection Control, 2013, 35(4): 68-73.
WU G, ZHANG B N, GUO D X, et al. Blind recognition of BCH codes in faster than-Nyquist signaling system [J]. Electronics Letters, 2016, 52(9): 716-718.
CHEN Jinjie, YANG Junan. A method of blind recognition to coding parameters of linear block codes [J]. Journal of Circuits and Systems, 2013, 18(2): 249-254.
ZRELLI G, MARAZIN M, RANNON E, et al. Blind identification of code word length for non-binary error-correcting codes in noisy transmission [J]. EURASIP Journal on Wireless Communication and Networking, 2015, 43: 1-16.
YANG Xiaowei, GAN Lu. Blind estimation algorithm of the linear block codes parameters based on WHT [J]. Journal of Electronics Information Technology, 2012, 34(7): 1642-1646.
CHA S H. Comprehensive survey on distance/similarity measures between probability density functions [J]. International Journal of Mathematical and Methods in Applied Sciences, 2007, 4(1): 300-307.
MOOSAVI R, LARSSON E G. A fast scheme for blind identification of channel codes [C]∥54th Annual IEEE Global Telecommunications Conference. Piscataway, NJ, USA: IEEE, 2011: 6133507.
MOOSAVI R, LARSSON E G. Fast blind recognition of channel codes [J]. IEEE Transactions on Communications, 2013, 62(5): 1393-1405.
陈鲁生, 沈世镒. 编码理论基础 [M]. 北京: 高等教育出版社, 2005: 37-58.
LIN S, COSTELLO D J. Error control coding [M]. 2nd ed. Upper Saddle River, NJ, USA: Prentice Hall, 2005: 130-136.