Spatially-coupled MacKay-Neal codes and Hsu-Anastasopoulos codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 747-751

  Kasai, Kenta ^a   Sakaniwa, Kohichi ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

iterative decoding; LDPC code; spatial coupling

Indexed keywords

BINARY ERASURE CHANNEL; LDPC CODES; MAP DECODING; MEMORYLESS; SHANNON LIMIT; SPATIAL COUPLINGS;

CODES (SYMBOLS); CODING ERRORS; ITERATIVE DECODING;

ERROR CORRECTION;

EID: 80054795450     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6034233     Document Type: Conference Paper

References (23)

1. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge University Press, Mar. 2008.
2. E. Arikan, "Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels", IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051-3073, Jul. 2009.
3. S. Kudekar, T. Richardson, and R. Urbanke, "Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC", IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 803-834, Feb. 2011.
4. S. Kudekar, C. Méasson, T. J. Richardson, and R. L. Urbanke, "Threshold saturation on BMS channels via spatial coupling", Apr. 2010, http://arxiv.org/abs/1004.3742.
5. A. J. Felström and K. S. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix", IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2181-2191, Jun. 1999.
6. M. Lentmaier, D. V. Truhachev, and K. S. Zigangirov, "To the theory of low-density convolutional codes. II", Probl. Inf. Transm., no. 4, pp. 288-306, 2001.
7. A. Sridharan, J. M. Lentmaier, D. J. Costello, and K. S. Zigangirov, "Convergence analysis of a class of LDPC convolutional codes for the erasure channel", in Proc. 42th Annual Allerton Conf. on Commun., Control and Computing, Montecillo, Illinois, USA, Oct. 2004.
8. M. Lentmaier, A. Sridharan, D. J. Costello, Jr., and K. S. Zigangirov, "Iterative decoding threshold analysis for LDPC convolutional codes", IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5274-5289, Oct. 2010.
9. C. Méasson, A. Montanari, T. Richardson, and R. Urbanke, "The generalized area theorem and some of its consequences", IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 4793-4821, Nov. 2009.
10. G. Miller and D. Burshtein, "Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes", IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2696-2710, Nov. 2001.
11. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes", IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
12. R. Mori and T. Tanaka, "Performance and construction of polar codes on symmetric binary-input memoryless channels", Jan. 2009, http://arxiv.org/abs/0901.2207.
13. A. Khandekar and R. McEliece, "On the complexity of reliable communication on the erasure channel", in Proc. 2001 IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2001, p. 1.
14. D. Mitchell, M. Lentmaier, and D. Costello, "New families of ldpc block codes formed by terminating irregular protograph-based LDPC convolutional codes", in Proc. 2010 IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2010, pp. 824-828.
15. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels", IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1611-1635, Jul. 2003.
16. H. Pfister and I. Sason, "Accumulate repeat accumulate codes: Capacityachieving ensembles of systematic codes for the erasure channel with bounded complexity", IEEE Trans. Inf. Theory, vol. 53, no. 6, pp. 2088-2115, Jun. 2007.
17. D. MacKay, "Good error-correcting codes based on very sparse matrices", IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
18. T. Murayama, Y. Kabashima, D. Saad, and R. Vicente, "Statistical physics of regular low-density parity-check error-correcting codes", Phys. Rev. E, vol. 62, no. 2, pp. 1577-1591, Aug. 2000.
19. T. Tanaka and D. Saad, "Typical performance of regular low-density parity-check codes over general symmetric channels", J. Phys. A: Math. Gen., vol. 36, no. 43, pp. 11143-11157, Oct. 2003.
20. C. H. Hsu and A. Anastasopoulos, "Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding", IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 992-1006, Mar. 2010.
21. J. Cheng and R. McEliece, "Some high-rate near capacity codecs for the gaussian channel", in Proc. 34th Annual Allerton Conf. on Commun., Control and Computing, Oct. 1996.
22. M. Wainwright and E. Martinian, "Low-density graph codes that are optimal for binning and coding with side information", IEEE Trans. Inf. Theory, vol. 55, no. 3, pp. 1061-1079, Mar. 2009.
23. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs", IPN Progress Report, pp. 42-154, Aug. 2003.