Advertisement

Protograph-Based Design of Non-Binary LDPC Codes

  • I. Divya
  • M. Anbuselvi
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 325)

Abstract

This paper presents construction of non-binary LDPC codes using protograph method. A new class of LDPC codes is constructed from a template called a protograph. The protograph serves as a blueprint for constructing LDPC codes of arbitrary size in which the performance can be predicted by analyzing the protograph. The significance of this approach is the reduction of number of nodes of computation in the decoding process. Furthermore, they also benefit for low memory requirements, simple design procedure, as well as hardware-friendly implementation. ARA-based code is a kind of linear class codes having self-correcting capabilities. It is used to transmit messages over noisy transmission channel. Due to this, the information loss can be made as small as possible. These codes constitute a subclass of LDPC codes with very fast encoder structure. They also have a projected graph or protograph representation that allows for high-speed decoder implementation. Because of the unique feature the, ARA code is mainly used in supporting remote sensing, digital video broadcasting, and data delay applications. The decoding performance of the ARA-based LDPC codes with varied punctured patterns and repetition rates is analyzed. Computation of weighted enumerators for the design of non-binary LDPC codes is done. The simulation results of protograph-based LDPC codes are calculated by bit error rate (BER) performance.

References

  1. 1.
    R.G. Gallager, Low density parity check codes. IRE Trans. Inf. Theor. (1962)Google Scholar
  2. 2.
    J. Thorpe, Low-Density Parity-Check Codes Constructed from Protographs (IPN Progress Report, JPL, USA, 2003), pp. 42–154Google Scholar
  3. 3.
    A. Abbasafar, D. Divsalar, K. Yao, A comparison of MC/DC, MUMCUT and several other coverage criteria for logical decisions. J. Syst. Softw. (2007)Google Scholar
  4. 4.
    A. Abbasafar, Accumulate repeat accumulate codes. IEEE Trans. commun. 55, 692–702 (2007)Google Scholar
  5. 5.
    D. Divsalar, C. Jones, S. Dolinar, J. Thorpe, Protograph based LDPC codes with minimum distance linearly growing with block size, in IEEE Globecom (2005)Google Scholar
  6. 6.
    D. Divsalar, Ensemble weight enumerators for protograph LDPC codes, in Proceedings of IEEE International Symposium on Information Theory. (Seattle, WA, 2006), pp. 1554–1558Google Scholar
  7. 7.
    D. Divsalar, W. Ryan, Enumerators for protograph- based ensembles of LDPC and generalized LDPC codes. IEEE Trans. Theor. 57(2) (2011)Google Scholar
  8. 8.
    D. Divsalar, Low-rate LDPC codes with simple protograph structure. in IEEE ISIT (2005), pp. 4–9Google Scholar
  9. 9.
    D. Divsalar, Short protograph- based LDPC codes. IEEE Trans. Commun. (2010)Google Scholar
  10. 10.
    L. Costantini, Non-binary protograph low-density parity-check codes for space communications. Int. J. Satellite Commun. Netw. 30, 43–51 (2012)Google Scholar
  11. 11.
    D. Divsalar, L. Dolecek, Graph cover ensembles of non-binary protograph LDPC Code (IEEE ISIT, Boston, 2012)Google Scholar
  12. 12.
    D. Declercq, M. Fossorier, Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Trans. commun. 55(4) (2007)Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.ECE DepartmentSSN College of EngineeringKalvakkam, ChennaiIndia

Personalised recommendations