[Back]

Hua Zhou, D. Mitchell, N. Görtz, D. Costello:
"A Puncturing Algorithm for Rate-Compatible LDPC Convolutional Codes";
Talk: 7th International Symposium on Turbo Codes & Iterative Information Processing (ISTC 2012), Gothenburg, Sweden; 08-27-2012 - 08-31-2012; in: "Proceedings 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)", IEEE Xplore, (2012), ISBN: 978-1-4577-2114-4; 255 - 259.

A family of rate-compatible (RC) punctured low-density parity-check convolutional codes (LDPC-CCs) is derived from an LDPC-CC by periodically puncturing encoded bits (variable nodes) with respect to several criteria: (1) ensuring the recoverability of punctured variable nodes, (2) minimizing the number of completely punctured cycle trapping sets (CPCTSs), and (3) minimizing the number of punctured variable nodes involved in short cycles. As an example, a family of RC punctured LDPC-CCs with rates 4/9, 4/8, 4/7, 4/6, and 4/5 are obtained from the (21,3, 5) Tanner LDPC-CC.

A family of rate-compatible (RC) punctured low-density parity-check convolutional codes (LDPC-CCs) is derived from an LDPC-CC by periodically puncturing encoded bits (variable nodes) with respect to several criteria: (1) ensuring the recoverability of punctured variable nodes, (2) minimizing the number of completely punctured cycle trapping sets (CPCTSs), and (3) minimizing the number of punctured variable nodes involved in short cycles. As an example, a family of RC punctured LDPC-CCs with rates 4/9, 4/8, 4/7, 4/6, and 4/5 are obtained from the (21,3, 5) Tanner LDPC-CC.

LDPC convolutional codes, rate compatible, puncturing

http://dx.doi.org/10.1109/ISTC.2012.6325182

http://publik.tuwien.ac.at/files/PubDat_211754.pdf