Distance spectrum estimation of LDPC convolutional codes

Time-invariant low-density parity-check convolutional codes (LDPC-CCs) derived from corresponding quasi-cyclic (QC) LDPC block codes (LDPC-BCs) can be described by a polynomial syndrome former matrix (polynomial-domain transposed parity-check matrix). In this paper, an estimation of the distance spectrum of time-invariant LDPC-CCs is obtained by splitting the polynomial syndrome former matrix into submatrices representing “super codes” and then evaluating the linear dependence between codewords of the corresponding super codes. This estimation results in an upper bound on the minimum free distance of the original code and, additionally, a lower bound on the number of codewords Aw with Hamming weight w.

[1]  Duncan G. Elliott,et al.  Termination Sequence Generation Circuits for Low-Density Parity-Check Convolutional Codes , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[2]  Ali Emre Pusane,et al.  A Comparison Between LDPC Block and Convolutional Codes , 2006 .

[3]  John J. Cannon,et al.  The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[4]  Morii Masakatu,et al.  Improvement of the Method for Computing the Weight Spectrum of LDPC Convolutional Codes , 2011 .

[5]  Lalit R. Bahl,et al.  An efficient algorithm for computing free distance (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[6]  Rolf Johannesson,et al.  A BEAST for prowling in trees , 2004, IEEE Transactions on Information Theory.

[7]  L. Litwin,et al.  Error control coding , 2001 .

[8]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[9]  Norbert Goertz,et al.  Cycle analysis of time-invariant LDPC convolutional codes , 2010, 2010 17th International Conference on Telecommunications.

[10]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[11]  Fukuda Akira,et al.  Robustness Evaluation of Common Information Exploiting Characteristics of Multipath Fading Channel For Handheld Devices , 2011 .

[12]  Daniel J. Costello,et al.  An algorithm for computing the distance spectrum of trellis codes , 1989, IEEE Journal on Selected Areas in Communications.

[13]  D. Mackay,et al.  Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .

[14]  David G. M. Mitchell,et al.  Quasi-cyclic LDPC codes based on pre-lifted protographs , 2011, 2011 IEEE Information Theory Workshop.

[15]  Norbert Goertz,et al.  Cycle analysis of time-variant LDPC convolutional codes , 2010 .