Increasing the rate of spatially-coupled codes via optimized irregular termination
- 20 October 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 31-35
Abstract
In this paper, we consider the rate-loss problem for spatially-coupled LDPC (SC-LDPC) codes on the binary erasure channel. Although SC-LDPC codes have good noise thresholds under belief-propagation (BP) decoding, they also suffer a rate-loss due to termination that is significant at moderate blocklengths. Our idea is to attach additional variable nodes at the boundary using an irregular degree distribution. Then, this degree distribution is optimized to improve the code rate without reducing the BP threshold. The optimization is formulated as an linear program and solved numerically. Our results show that the code rate can be increased by a reasonable amount without decreasing the BP threshold.Keywords
This publication has 9 references indexed in Scilit:
- Efficient termination of spatially-coupled codes2012
- Spatially coupled ensembles universally achieve capacity under belief propagation2012
- Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BECIEEE Transactions on Information Theory, 2011
- Modern Coding Theory2008
- Expander codes2002
- Time-varying periodic convolutional codes with low-density parity-check matrixIEEE Transactions on Information Theory, 1999
- Practical loss-resilient codes1997
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1996
- Low-Density Parity-Check Codes1963