Blind Frame Synchronization of Product Codes Based on the Adaptation of the Parity Check Matrix

We present in this paper a blind frame synchronization method based on the adaptation of the parity check matrix of the code. The blind synchronizer is initially based on the calculation of the Log-Likelihood Ratios (LLR) of the syndrome elements, obtained using the parity check matrix of the code. Before applying our synchronization procedure, we propose in this paper to rearrange the parity check matrix of the code according to the reliability of the received symbols as previously introduced for decoding linear block codes with high density parity check matrix. Simulation results show that the Frame Error Rate (FER) curves obtained after applying the proposed synchronization method to product codes are very close to the ones with perfect synchronization. In addition to its powerful synchronization properties, the main advantage of the proposed synchronization algorithm is its capability of being introduced as a part of the decoder so that no additional material is required for the synchronization step.

[1]  Peter Elias,et al.  Error-free Coding , 1954, Trans. IRE Prof. Group Inf. Theory.

[2]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[3]  Rodrigue Imad,et al.  Blind frame synchronization for error correcting codes having a sparse parity check matrix , 2009, IEEE Transactions on Communications.

[4]  Mostofa K. Howlader,et al.  Decoder-assisted frame synchronization for packet transmission , 2001, IEEE J. Sel. Areas Commun..

[5]  P. Robertson A generalized frame synchronizer , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[6]  Costas N. Georghiades,et al.  Frame synchronization for coded systems over AWGN channels , 2004, IEEE Transactions on Communications.

[7]  Krishna R. Narayanan,et al.  Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix , 2005, IEEE Transactions on Information Theory.

[8]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[9]  Catherine Douillard,et al.  Blind frame synchronization on Gaussian channel , 2007, 2007 15th European Signal Processing Conference.

[10]  Christophe Jégo,et al.  Turbo Decoding of Product Codes based on the Modified Adaptive Belief Propagation Algorithm , 2007, 2007 IEEE International Symposium on Information Theory.

[11]  Sébastien Houcke,et al.  Blind frame synchronisation for block code , 2006, 2006 14th European Signal Processing Conference.

[12]  M. Debbah,et al.  SPC01-6: Blind Detection for Block Coded Interleaved Division Multiple Access , 2006, IEEE Globecom 2006.

[13]  J. Massey,et al.  Optimum Frame Synchronization , 1972, IEEE Trans. Commun..

[14]  M.C. Valenti,et al.  Optimum frame synchronization for preamble-less packet transmission of turbo codes , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[15]  Ramesh Pyndiah,et al.  Near optimum decoding of product codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[16]  Krishna R. Narayanan,et al.  Iterative soft decoding of Reed-Solomon codes , 2004, IEEE Communications Letters.

[17]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.