article

Finite-length rate-compatible LDPC codes: a novel puncturing scheme

Authors:

Badri N. Vellambi,

Faramarz FekriAuthors Info & Claims

IEEE Transactions on Communications, Volume 57, Issue 2

Pages 297 - 301

https://doi.org/10.1109/TCOMM.2009.02.060098

Published: 01 February 2009 Publication History

Abstract

In this paper, we study rate-compatible puncturing of finite-length low-density parity-check (LDPC) codes. We present a novel rate-compatible puncturing scheme that is easy to implement. Our scheme uses the idea that the degradation in performance is reduced by selecting a puncturing pattern wherein the punctured bits are far apart from each other in the Tanner graph of the code. Although the puncturing scheme presented is tailored to regular codes, it is also directly applicable to irregular parent ensembles. By simulations, the proposed rate-compatible puncturing scheme is shown to be superior to the existing puncturing methods for both regular and irregular LDPC codes over the binary erasure channel (BEC) and the additive white Gaussian noise (AWGN) Channel.

References

[1]

J. Hagenauer, "Rate-compatible punctured convolutional codes (rcpc codes) and their applications," IEEE Trans. Commun., vol. 36, no. 4, pp. 389-399, Apr. 1988.

[2]

F. Babich, G. Montorsi, and F. Vatta, "Design of rate-compatible punctured turbo (RCPT) codes," in Proc. IEEE International Conference on Communications (ICC 2002), vol. 3, May 2002, pp. 1701-1705.

[3]

J. Ha, J. Kim, and S. W. McLaughlin, "Rate-compatible puncturing of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 50, no. 11, pp. 2824-2836, Nov. 2004.

[4]

J. Ha and S. W. McLaughlin, "Optimal puncturing distributions for rate-compatible low-density parity-check codes," in Proc. 2003 IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, 2003, pp. 233.

[5]

J. Ha and S. W. McLaughlin, "Optimal puncturing of irregular low-density parity-check codes," in Proc. IEEE International Conference on Communications (ICC 2003), Anchorage, Alaska, May 2003, pp. 3110-3114.

[6]

H. Pishro-Nik and F. Fekri, "Results on punctured low-density parity-check codes and improved iterative decoding techniques," in Proc. 2004 IEEE Information Theory Workshop, San Antonio, TX, Oct. 2004, pp. 24-29.

[7]

C. Di, D. Proietti, I. E. Telatar, T. Richardson, and R. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 1570-1579, June 2002.

Digital Library

[8]

T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Finite-length analysis for various low-density-parity-check ensembles for the binary erasure channel," in Proc. 2002 IEEE International Symposium on Information Theory (ISIT), Lausanne, Switzerland, June 2002, pp. 1.

[9]

J. Ha, J. Kim, and S. W. McLaughlin, "Puncturing for finite length low-density parity-check codes," in Proc. 2004 IEEE International Symposium on Information Theory (ISIT), Chicago, June 2004, pp. 152.

[10]

A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles," IEEE Trans. Inform. Theory, vol. 51, pp. 929-953, Mar. 2005.

Digital Library

[11]

D. Bi and L. C. Pérez, "Rate-compatible low-density parity-check codes with rate-compatible degree profiles," IEE Electron. Lett., vol. 42, no. 1, pp. 41-43, Jan. 2006.

[12]

M. R. Yazdani and A. H. Banihashemi, "On construction of rate-compatible low-density parity-check codes," IEEE Commun. Lett., vol. 8, no. 3, pp. 159-161, Mar. 2004.

[13]

J. Li and K. Narayanan, "Rate-compatible low density parity check codes for capacity-approaching ARQ schemes in packet data communications," in Proc. International Conference on Communications, Internet and Information Technology (CIIT), US Virgin Islands, pp. 201-206, Nov. 2002.

[14]

A. Shokrollahi and R. Storn, "Design of efficient erasure codes with differential evolution," in Proc. 2000 IEEE International Symposium on Information Theory (ISIT), June 2000, pp. 5.

[15]

X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Regular and irregular progressive edge-growth tanner graphs." IEEE Trans. Inform. Theory, vol. 51, no. 1, pp. 386-398, 2005.

Digital Library

[16]

J. Ha, J. Kim, D. Klinc, and S. W. McLaughlin, "Rate-compatible punctured low-density parity-check codes with short block lengths," IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 728-738, Feb. 2006.

Digital Library

[17]

T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.

Digital Library

Cited By

Babich FNoschese MVatta F(2021)Analysis and design of rate compatible LDPC codes2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)10.1109/PIMRC.2016.7794684(1-6)Online publication date: 10-Mar-2021
https://dl.acm.org/doi/10.1109/PIMRC.2016.7794684
Ranganathan SDivsalar DWesel R(2019)Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-LengthsIEEE Transactions on Information Theory10.1109/TIT.2019.289532265:6(3758-3777)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1109/TIT.2019.2895322
Barzegar HReggiani L(2017)LDPC encoding for partial-duplex wireless communication2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)10.1109/PIMRC.2017.8292762(1-5)Online publication date: 8-Oct-2017
https://dl.acm.org/doi/10.1109/PIMRC.2017.8292762

Finite-length rate-compatible LDPC codes: a novel puncturing scheme
1. Mathematics of computing
  1. Information theory
2. Security and privacy
  1. Cryptography

Recommendations

Burst erasure correcting LDPC codes

In this paper low-density parity-check (LDPC) codes are designed for burst erasure channels. Firstly, lower bounds for the maximum length erasure burst that can always be corrected with message-passing decoding are derived as a function of the parity-...
The design of efficiently-encodable rate-compatible LDPC codes

We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide ...
LDPC codes based on serially concatenated multiple parity-check codes

This letter proposes a new class of serially concatenated codes that can be viewed as Low-Density Parity-Check (LDPC) codes. They are derived from Multiple Serially Concatenated Single Parity-Check (M-SC-SPC) codes, but they use different components, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Communications

IEEE Transactions on Communications Volume 57, Issue 2

February 2009

286 pages

ISSN:0090-6778

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 February 2009

Revised: 22 April 2007

Received: 21 February 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Babich FNoschese MVatta F(2021)Analysis and design of rate compatible LDPC codes2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)10.1109/PIMRC.2016.7794684(1-6)Online publication date: 10-Mar-2021
https://dl.acm.org/doi/10.1109/PIMRC.2016.7794684
Ranganathan SDivsalar DWesel R(2019)Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-LengthsIEEE Transactions on Information Theory10.1109/TIT.2019.289532265:6(3758-3777)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1109/TIT.2019.2895322
Barzegar HReggiani L(2017)LDPC encoding for partial-duplex wireless communication2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)10.1109/PIMRC.2017.8292762(1-5)Online publication date: 8-Oct-2017
https://dl.acm.org/doi/10.1109/PIMRC.2017.8292762

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents