The design of efficiently-encodable rate-compatible LDPC codes - [transactions papers]
- 18 February 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 57 (2) , 365-375
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.Keywords
This publication has 10 references indexed in Scilit:
- Rate-compatible punctured low-density parity-check codes with short block lengthsIEEE Transactions on Information Theory, 2006
- Rate-Compatible Puncturing of Low-Density Parity-Check CodesIEEE Transactions on Information Theory, 2004
- Selective Avoidance of Cycles in Irregular LDPC Code ConstructionIEEE Transactions on Communications, 2004
- Design of Efficiently Encodable Moderate-Length High-Rate Irregular LDPC CodesIEEE Transactions on Communications, 2004
- On Construction of Rate-Compatible Low-Density Parity-Check CodesIEEE Communications Letters, 2004
- Construction of short block length irregular low-density parity-check codes2004
- Efficient encoding of low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Rate-compatible punctured convolutional codes (RCPC codes) and their applicationsIEEE Transactions on Communications, 1988
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981