Computer Science – Information Theory
Scientific paper
2007-05-03
Computer Science
Information Theory
Accepted subject to minor revision to IEEE Trans. on Comm
Scientific paper
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 range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are linear-time encodable with simple shift-register circuits. For a block length of 1200 bits the codes outperform optimized irregular LDPC codes and extended irregular repeat-accumulate (eIRA) codes for all puncturing rates 0.6~0.9 (base code performance is almost the same) and are particularly good at high puncturing rates where good puncturing performance has been previously difficult to achieve.
Kim Jaehong
McLaughlin Steven W.
Ramamoorthy Aditya
No associations
LandOfFree
The Design of Efficiently-Encodable Rate-Compatible LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Design of Efficiently-Encodable Rate-Compatible LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Design of Efficiently-Encodable Rate-Compatible LDPC Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-614987