• DocumentCode
    2266919
  • Title

    Improved min-sum decoding algorithms for irregular LDPC codes

  • Author

    Chen, Jinghu ; Tanner, R. Michael ; Jones, Christopher ; Li, Yan

  • Author_Institution
    Dept. of Comput. Sci., Illinois Univ., Chicago, IL
  • fYear
    2005
  • fDate
    4-9 Sept. 2005
  • Firstpage
    449
  • Lastpage
    453
  • Abstract
    In this paper, we apply two improved min-sum algorithms, the normalized and offset min-sum algorithms, to the decoding of irregular LDPC codes. We show that the behavior of the two algorithms in decoding irregular LDPC codes is different from that in decoding regular LDPC codes, due to the existence of bit nodes of degree two. We analyze and give explanations to the difference, and propose approaches to improve the performance of the two algorithms
  • Keywords
    decoding; parity check codes; bit nodes; low-density parity-check codes; min-sum decoding algorithms; AWGN channels; Algorithm design and analysis; Computer science; Decoding; Degradation; Inference algorithms; Parity check codes; Performance analysis; Quantization; Signal to noise ratio;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
  • Conference_Location
    Adelaide, SA
  • Print_ISBN
    0-7803-9151-9
  • Type

    conf

  • DOI
    10.1109/ISIT.2005.1523374
  • Filename
    1523374