Spatially Coupled LDPC Codes | Webdemo | Institute of Telecommunications, University of Stuttgart

References

• [1] R. M. Tanner, A recursive approach to low complexity codes, IEEE Trans. on Information Theory, 1981.

• [2] A. J. Felström, K. S. Zigangirov, Time-Varying Periodic Convolutional Codes with Low-Density Parity-Check Matrix, IEEE Trans. Inform. Theory, 1999.

• [3] W. E. Ryan, An Introduction to LDPC Codes, Department of Electrical and Computer Engineering, University of Arizona, 2003.

• [4] S. Kudekar, T. Richardson, R. L. Urbanke, Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation, IEEE Trans. On Information Theory, 2013.

• [5] R. Urbanke, T. Richardson, Modern Coding Theory, Cambridge University Press, 2008.

• [6] S. Kudekar, T. Richardson, R. L. Urbanke, Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC, IEEE Trans. Inform. Theory, 2011.