Blind recognition of linear block codes based on matrix analysis

被引：0
|
作者：
Liu J. [1 ]
Zhang L. [1 ]
Zhan C. [2 ]
机构：
[1] Institute of Information Fusion, Naval Aeronautical and Astronautical University, Yantai
[2] Unit 92515 of the PLA, Huludao
来源：
Zhang, Limin (iamzlm@163.com) | 2017年 / Chinese Institute of Electronics卷 / 39期
关键词：
Gauss elimination; Linear block code; Matrix analysis method; Statistical decision;
D O I：
10.3969/j.issn.1001-506X.2017.02.26
中图分类号：
学科分类号：
摘要：
Since the existing matrix analysis method has a poor performance when solving the blind recognition problems of linear block codes, an improved method is proposed. Firstly, Gauss elimination algorithm is applied to the interception matrix and the normalized weight of each column is calculated, then a statistical estimation is used to find correlation columns in the matrix, based on which a statistical index is setted up to get the code length according to the distribution of maximum values. To achieve successful recognition of code start bit under high bit error rate (BER), shift operation with many times of average is adopted after code length identification. Simulation results show that the proposed method has a better fault-tolerant performance when comparing to the traditional matrix analysis method, while the computational complexity is approximately the same, thus it can be more effective for the blind recognition problem. © 2017, Editorial Office of Systems Engineering and Electronics. All right reserved.
引用
收藏
页码：404 / 409
页数：5
相关论文
共 16 条
  • [1] Moosavi R., Larsson R.G., A fast scheme for blind identification of channel codes, Proc. of the IEEE Global Telecommunications Conference, pp. 1-5, (2011)
  • [2] Debessu Y.G., Wu H.C., Jiang H., Novel blind encoder parameter estimation for Turbo codes, IEEE Communication Letters, 16, 12, pp. 1917-1920, (2012)
  • [3] Xia T., Wu H.C., Identification of non-binary LDPC codes using average LLR of syndrome a posteriori probability, IEEE Communication Letters, 17, 7, pp. 1301-1304, (2013)
  • [4] Zrelli G., Marazin M., Rannon E., Et al., Blind identification of code word length for non-binary error-correcting codes in noisy transmission, EURASIP Journal on Wireless Communication and Networking, 43, pp. 1-16, (2015)
  • [5] Zhou J., Huang Z.P., Su S.J., Et al., Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations, Entropy, 15, 5, pp. 1705-1725, (2013)
  • [6] Zhou J., Huang Z.P., Su S.J., Et al., Blind recognition of binary cyclic codes, EURASIP Journal on Wireless Communication and Networking, 218, pp. 1-17, (2013)
  • [7] Qi L., Hao S.H., Li J.S., Recognition method of RS codes based on euclidean algorithm in Galois field, Journal of Detection and Control, 33, 2, pp. 63-67, (2011)
  • [8] Xie H., Wang F.H., Huang Z.T., At A.L., Blind detection and recognition of RS code based on spectral preprocessing, Journal of Astronautics, 34, 1, pp. 129-132, (2013)
  • [9] Zhang Y.G., Lou C.Y., Wang T., A blind parameters identification method for linear blockcode, (2010)
  • [10] Valembois A., Detection and recognition of a binary linear code, Discrete Applied Mathematics, 111, 1-2, pp. 199-218, (2011)
12