Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the construction of some capacity-approaching coding schemes
On the construction of some capacity-approaching coding schemes
The design of efficiently-encodable rate-compatible LDPC codes
IEEE Transactions on Communications
Design of repeat-accumulate codes for iterative detection and decoding
IEEE Transactions on Signal Processing
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Design methods for irregular repeat-accumulate codes
IEEE Transactions on Information Theory
Extrinsic information transfer functions: model and erasure channel properties
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
Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
IEEE Transactions on Information Theory
Rate-compatible IRA codes using quadratic congruential extension sequences and puncturing
IEEE Communications Letters
| Hi-index | 0.00 |
We consider the design and analysis of the efficiently-encodable rate-compatible (E2RC) irregular LDPC codes proposed in previous work. In this work we introduce semi-structured E2RC-like codes and protograph E2RC codes. EXIT chart based methods are developed for the design of semi-structured E2RC-like codes that allow us to determine near-optimal degree distributions for the systematic part of the code while taking into account the structure of the deterministic parity part, thus resolving one of the open issues in the original construction. We develop a fast EXIT function computation method that does not rely on Monte-Carlo simulations and can be used in other scenarios as well. Our approach allows us to jointly optimize code performance across the range of rates under puncturing.We then consider protograph E2RC codes (that have a protograph representation) and propose rules for designing a family of rate-compatible punctured protographs with low thresholds. For both the semi-structured and protograph E2RC families we obtain codes whose gap to capacity is at most 0.3 dB across the range of rates when the maximum variable node degree is twenty.