Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Efficient encoding of low-density parity-check codes
IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes
IEEE Transactions on Information Theory
Rate-compatible punctured low-density parity-check codes with short block lengths
IEEE Transactions on Information Theory
Design and analysis of E2RC codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Waterfall region performance of punctured LDPC codes over the BEC
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
The rate-compatible multi-edge type LDPC codes with short block length
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Design and analysis of E2RC codes using EXIT chart
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Rate-compatible IRA codes using quadratic congruential extension sequences and puncturing
IEEE Communications Letters
| Hi-index | 0.00 |
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.