• DocumentCode
    2896789
  • Title

    Investigation of circulant matrices for reversible LDPC codes

  • Author

    Puengnim, Anchalee

  • Author_Institution
    Dept. of Electr. Eng., Chiang Mai Univ., Thailand
  • Volume
    2
  • fYear
    2004
  • fDate
    26-29 Oct. 2004
  • Firstpage
    983
  • Abstract
    We investigate the error performance of reversible LDPC codes constructed from the circulant matrix (Haley, D. et al., IEEE Global Telecom. Conf., vol.1, p.1303-7, 2002) in the region of BER smaller than 10-5. We also propose and investigate other possible circulant matrices selected from some primitive polynomials over GF(2). We expect to offer another choice of block length and in some cases better error performance for reversible LDPC codes.
  • Keywords
    Galois fields; error statistics; matrix algebra; parity check codes; polynomials; BER; Galois fields; circulant matrices; low-density parity check codes; primitive polynomials; reversible LDPC codes; Encoding; Geometry; Iterative decoding; Iterative methods; Jacobian matrices; Linear feedback shift registers; Message passing; Parity check codes; Polynomials; Sum product algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications and Information Technology, 2004. ISCIT 2004. IEEE International Symposium on
  • Print_ISBN
    0-7803-8593-4
  • Type

    conf

  • DOI
    10.1109/ISCIT.2004.1413866
  • Filename
    1413866