Robust Rate-Compatible Punctured LDPC Convolutional Codes

A family of robust rate-compatible (RC) punctured low-density parity-check convolutional codes (LDPC-CCs) is derived from a time-invariant LDPC-CC mother code by periodically puncturing encoded bits (variable nodes) with respect to several criteria: (1) ensuring the recoverability of punctured varia...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 61; no. 11; pp. 4428 - 4439
Main Authors: Hua Zhou, Mitchell, David G. M., Goertz, Norbert, Costello, Daniel J.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.11.2013
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Applied sciences
Binomials
Charge carrier processes
Codes
Coding, codes
Convolutional codes
cycle enumerators
cycle trapping sets
Decoding
Exact sciences and technology
Information, signal and communications theory
Iterative decoding
low-density parity-check convolutional codes (LDPC-CCs)
punctured codes
Rate-compatible codes (RCCs)
Robustness
Signal and communications theory
spatially-coupled codes
Telecommunications and information theory
Vectors
Performance evaluation
Convolutional code
Bit error rate
Rate-compatible codes (RCCs)
cycle trapping sets
Iterative decoding
spatially-coupled codes
Time invariance
Trapping
punctured codes
Error correcting code
Parity check codes
cycle enumerators
low-density parity-check convolutional codes (LDPC-CCs)
Signal to noise ratio
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A family of robust rate-compatible (RC) punctured low-density parity-check convolutional codes (LDPC-CCs) is derived from a time-invariant LDPC-CC mother code 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. The influence of (1) and (3) on iterative decoding performance is felt most strongly in the waterfall region of the bit-error-rate (BER) curve, while (2) has a larger effect in the error floor, or high signal-to-noise ratio (SNR), region. We show that the length of the puncturing period is an important parameter when designing high rate punctured codes and, moreover, that extending the puncturing period can improve the decoding performance and extend the range of compatible rates. As examples, we obtain families of RC LDPC-CCs from several time-invariant LDPC-CC mother codes with monomial and binomial entries in their polynomial syndrome former matrices.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2013.101813.120864