• DocumentCode
    3391408
  • Title

    Reduced Complexity Decoding Algorithm of LDPC Codes using Node Elimination

  • Author

    Kim, Joon-Sung ; Song, Hong-Yeop

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Yonsei Univ., Seoul
  • fYear
    2006
  • fDate
    Oct. 2006
  • Firstpage
    1
  • Lastpage
    3
  • Abstract
    We propose a modified belief propagation algorithm that uses node elimination for bit nodes of large log-likelihood ratio. With this algorithm, we can reduce decoding complexity and improve performance by enhancing the cycle properties. Simulation results show that the decoding complexity is reduced and the proposed algorithm outperforms the belief propagation algorithm in the high-Eb/No region
  • Keywords
    decoding; graph theory; parity check codes; LDPC; belief propagation algorithm; bipartite graph; cycle properties; decoding; log-likelihood ratio; low density parity check code; node elimination; Belief propagation; Bipartite graph; Bit error rate; Equations; Information theory; Iterative algorithms; Iterative decoding; Linear code; Parity check codes; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication systems, 2006. ICCS 2006. 10th IEEE Singapore International Conference on
  • Conference_Location
    Singapore
  • Print_ISBN
    1-4244-0411-8
  • Electronic_ISBN
    1-4244-0411-8
  • Type

    conf

  • DOI
    10.1109/ICCS.2006.301432
  • Filename
    4085727
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3391408