Open Access Open Access  Restricted Access Subscription or Fee Access

Construction of Optimal Puncturing of Low-Density Parity-Check Codes

S. Suresh Kumar, M. Rajaram

Abstract


Low-density parity-check with Length-compatible and low error floors (LDPC-LCLEF) on the binary symmetric channel is presented in this paper. These codes can support a wide range of lengths for a given rate and also the Tanner graphs are free of small trapping sets. This can be obtained by applying the schemes of shortening and puncturing to good LDPC codes and the trapping sets are selected using the trapping set ontology based on their relative harmfulness for the given decoding algorithm. The conventional approach does not guarantee to have a good performance as the degree distributions may be wildly varied. In this paper, a modified algorithm is presented to generate LDPC codes of a given rate with almost their degree distributions are same as the mother code degree distribution. Also the relative harmfulness for different trapping sets are evaluated and decoding failures of one trapping set in presence or absence of other trapping sets are analyzed. To facilitate this discussion, a new description of structured LDPC codes with arrays of permutation matrices as parity-check matrices is given. Numerical results show that the LDPC code constructed by this approach performed much better than the conventional approach.

Keywords


LDPC Codes, Tanner Graph, TSO, Mother Code

Full Text:

PDF

References


T. Tian and C. R. Jones, “Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing”, EURASIP J.Wireless Commun. Networking, Vol. 5, pp. 789–795, 2005.

J. Ha, J. Kim, and S. W. McLaughlin, “Rate-compatible puncturing oflow-density parity-check codes”, IEEE Trans. Inf. Theory, Vol. 50, No. 11, pp. 2824–2836, 2004.

M. G. Stepanov, V. Chernyak, M. Chertkov, and B. Vasic, “Diagnosis of weaknesses in modern error correction codes: A physics approach”, Phys. Rev. Lett., Vol. 95, No. 22, pp. 228701–228704, 2005.

S. K. Chilappagari, M. Chertkov, M. G. Stepanov, and B. Vasic, “Instanton- based techniques for analysis and reduction of error floors of LDPC codes”, IEEE JSAC Capacity Approach. Codes, Vol. 27, No. 6, pp. 855–865, 2009.

S. N. Hong and D. J. Shin, “Optimal puncturing of block-type LDPC codes and their fast convergence decoding”, in Proc. IEEE Int.Symp. Inform. Theory, p. 826, 2006

G. Yue, X.Wang, and M. Madihian, “Design of rate-compatible irregular repeat accumulate codes”, IEEE Trans. Commun., Vol. 55, No. 6, pp. 1153–1163, 2007.

H. Xiao and A. H. Banihashemi, “Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration”, IEEE Trans. Commun., Vol. 57, No. 6, pp. 1550–1555, 2009.

L. Dolecek, Z. Zhang, V. Anantharam, M. J. Wainwright, and B. Nikolic, “Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes”, IEEE Trans. Inf. Theory, Vol. 56, No. 1, pp. 181–201, 2010.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.