Spatially Coupled Repeat-Accumulate Codes

In this paper we propose a new class of spatially coupled codes based on regular repeat-accumulate codes. We show that these codes have several advantages over spatially coupled regular low-density parity-check codes including simpler encoders and slightly higher code rates when the thresholds and decoding complexity (as measured by the Tanner graph edge density) are similar.

[1]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[2]  Rüdiger L. Urbanke,et al.  Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC , 2010, IEEE Transactions on Information Theory.

[3]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[4]  Michael Lentmaier,et al.  Terminated LDPC convolutional codes with thresholds close to capacity , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[5]  D. Costello,et al.  Approaching capacity with asymptotically regular LDPC codes , 2009, 2009 Information Theory and Applications Workshop.

[6]  Michael Lentmaier,et al.  Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.

[7]  Michael Lentmaier,et al.  New families of LDPC block codes formed by terminating irregular protograph-based LDPC convolutional codes , 2010, 2010 IEEE International Symposium on Information Theory.

[8]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .