• DocumentCode
    3067599
  • Title

    Rate-compatible non-binary LDPC codes concatenated with multiplicative repetition codes

  • Author

    Kasai, Keisuke ; Declercq, David ; Poulliat, Charly ; Sakaniwa, Kohichi

  • Author_Institution
    Dept. of Commun. & Integrated Syst., Tokyo Inst. of Technol., Tokyo, Japan
  • fYear
    2010
  • fDate
    13-18 June 2010
  • Firstpage
    844
  • Lastpage
    848
  • Abstract
    We propose non-binary LDPC codes concatenated with multiplicative repetition codes. To the best of the authors´ knowledge, for the transmissions over the memoryless binary-input output-symmetric channels, 2m-ary the (2,dc)-regular LDPC code for m ~ 8 and dc ≥ 3 is the best code so far among codes with moderate code length. By multiplicatively repeating the 2m-ary (2,3)-regular LDPC code of rate 1/3, we construct rate-compatible codes of lower rates 1/6,1/9,1/12,.... Surprisingly, such simple low-rate codes outperform the best low-rate binary codes so far.
  • Keywords
    concatenated codes; iterative decoding; memoryless systems; parity check codes; telecommunication channels; iterative decoding; low-density parity-check code; memoryless binary input output symmetric channel; multiplicative repetition codes; rate-compatible nonbinary LDPC codes; Automatic repeat request; Belief propagation; Binary codes; Concatenated codes; Degradation; Error correction codes; Iterative decoding; Optimization methods; Parity check codes; Time-varying channels; iterative decoding; low-rate code; non-binary low-density parity-check code; rate compatible code;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
  • Conference_Location
    Austin, TX
  • Print_ISBN
    978-1-4244-7890-3
  • Electronic_ISBN
    978-1-4244-7891-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2010.5513615
  • Filename
    5513615