pith. sign in

arxiv: 0705.0543 · v1 · pith:HZWTVYB7new · submitted 2007-05-03 · 💻 cs.IT · math.IT

The Design of Efficiently-Encodable Rate-Compatible LDPC Codes

classification 💻 cs.IT math.IT
keywords codespuncturinggoodirregularldpcperformanceratesbits
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.