Blind Recognition of Turbo Product Codes in Soft Decision Situations

Editorial

Authors

Faculty of Information and communication, Imam Hussein University, Tehran, Iran

Abstract

In this paper a method of blind recognition of the coding parameters for binary turbo product codes is proposed. The only knowledge is that the stream is encoded using binary product codes, while the coding parameters are unknown. The recognition processing includes two major procedures: code word length estimation and generator polynomial reconstruction. A hard decision method has been proposed in a previous literature. In this paper we propose the recognition approach in soft decisions situations with Binary-Phase-Shift-Key (BPSK) modulations and Additive-White-Gaussian-Noise (AWGN) channels. The code word length is estimated by maximizing the root information dispersion entropy function (RIDEF) for two dimension of the bit stream. And then we search for the code roots to reconstruct the primitive and generator polynomials. By utilizing the soft output of the channel, the recognition performance is improved and simulations show the efficiency of the proposed algorithm.

Keywords

References

[1]      Y. Xiaojing and W. Niancheng, “Recognition method of BCH codes based on roots information dispersion entropy and roots statistic,” Journal of Detection & Control, vol.32, no.3, pp.69–73, 2010.
[2]      J. Barbier, G. Sicot, and S. Houcke, “Algebraic approach for the reconstruction of linear and convolutional error correcting codes”, Proc. 3rd International Conference on Computer Science and Engineering CISE 2006, pp.66-71, 2006.
[3]      J. Barbier and J. Letessier, "Forward error correcting codes characterization based on rank properties," in proc.Int. Conf. Wireless Communications & Signal Processing, 2009, pp.1.-5.
[4]      J.Wang, Y.Yue, and J.Yao, “Statistical Recognition Method of Binary BCH Codes”, Communication and Network, vol. 3, p. 17, 2011.
[5]      G.Bangning, Z.XiangWen, D.Guo "Blind Recognition of BCH Code Based on Galois Field Fourier Transform" 978-1-4673-7687-7/15/$31.00 IEEE a©2015.
[6]      Z.Jing, H.Zhiping, S.Shaojing, “Blind Recognition of Binary Cyclic Codes” EURASIP Journal on Wireless Communication and Network. Vol.2013, pp.1-17, 2013.
[7]       مهدی تیموری، حمید رضا کاکایی، مرتضی حدادی، « شناسایی کور کدهای ضربی    BCH    » مجله مهندسی برق دانشگاه تبریز، جلد47، شماره 1، بهار 1396.
[8]      احمد قلی زاده سوته، حسین خالقی بیزکی، « تخمین پارامترهای کد BCH باینری در شرایط نویزی با استفاده از روش مبتنی بر بررسی بیت‌های توازن» مجله مهندسی برق دانشگاه تبریز، جلد47، شماره 1، بهار 1396.
[9]      N. Wen, X. Yang,” Recognition methods of BCH codes”. Electron. Warf.  6, 30–34, 2010.
[10]      X. Yang, N. Wen, “Recognition method of BCH codes on roots information dispersion entropy and roots statistic”. J. Detect. Control. 3, pp 69–73, 2010.
[11]      Jing Zhou, Zhiping Huang, Chunwu Liu, Shaojing Su and Yimeng Zhang “ information dispersion entropy Based Blind Recognition of Binary BCH Codes in Soft Decision”. Situation School of Mechatronics Engineering, National University of Defense Technology. 2013.
[12]      J.Hagenauer, E.Offer, and L.Papke;” Iterative decoding of binary block and convolutional codes”. IEEE Trans. Inf. Theory 2, pp 429–445, 1996.
[13]      J. Jiang, K.R. Narayanan, “Iterative soft-input-soft-output decoding of Reed-Solomon codes by adapting the parity check matrix”. IEEE Trans. Inf. Theory. 8, pp3746–3756; 2006.
[14]      CCSDS 130.1-G-2 “TM Synchronization and Channel Coding--Summary of Concept and Rationale”. Green Book. Issue 2. November 2012.

Files

Share

How to cite

Statistics