Statistical Recognition Method of Binary BCH Code
- 1
- 2
- 3
Abstract
In this paper, a statistical recognition method of the binary BCH code is proposed. The method is applied to both primitive and non-primitive binary BCH code. The block length is first recognized based on the cyclic feature under the condition of the frame length known. And then candidate polynomials are achieved which meet the restrictions. Among the candidate polynomials, the most optimal polynomial is selected based on the minimum rule of the weights sum of the syndromes. Finally, the best polynomial was factorized to get the generator polynomial recognized. Simulation results show that the method has strong capability of anti-random bit error. Besides, the algorithm proposed is very simple, so it is very practical for hardware im-plementation.
- F. H. Wang, Z. T. Huang and Y. Y. Zhou, “A Method for Blind Recognition of Convolution Code Based on Euclidean Algorithm,” IEEE International Conference on Wireless Communication Networking and Mobile Computing, Shanghai, 2007, pp. 1414-1417. doi:10.1109/WICOM.2007.358
- P. Z. Lu, L. Shen, Y. Zou and X. Y. Luo, “Blind Recognition of Punctured Convolutional Codes,” Science in China, Vol. 48, No. 4, 2005, pp. 484-498. doi: 10.1360/03yf0480
- J. J. Zan and Y. B. Li, “Blind Recognition of Low Code-Rate Binary Linear Block Code,” Radio Engineering of China, Vol. 39, No. 1, 2009, pp. 19-24.
- J. Liu, N. Xie and X. Y. Zhou, “Blind Recognition Method of RS Coding,” Journal of Electronic Science and Technology, Vol. 38, No. 3, March 2009, pp. 363- 367.
- S. Lin and D. J. Costello, “Error Control Coding,” 2nd Edition, Pearson Prentice Hall, Upper Saddle River, 2004, pp. 136-146.
- X. Wang, X. M. Wang and B. D. Wei, “An Efficient and Deterministic Algorithm to Determine Irreducible and Primitive Polynomials over Finite Fields,” Acta Scientriarum Naturalium Universitatis Sunyatseni, Vol. 48, No. 1, 2009, pp. 6-9.