Construction of Optimal Puncturing of Low-Density Parity-Check Codes
Abstract
Keywords
Full Text:
PDFReferences
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.
This work is licensed under a Creative Commons Attribution 3.0 License.