PWG: Progressive Weight-Growth Algorithm for LDPC Codes

DOI Web Site Web Site 参考文献6件
  • LI Xiangxue
    Department of Computer Science and Technology, East China Normal University National Engineering Laboratory for Wireless Security, Xi'an University of Posts and Telecommunications
  • ZHENG Qingji
    Department of Computer Science, University of Texas at San Antonio
  • QIAN Haifeng
    National Engineering Laboratory for Wireless Security, Xi'an University of Posts and Telecommunications
  • ZHENG Dong
    Department of Computer Science and Engineering, Shanghai Jiao Tong University
  • CHEN Kefei
    Department of Computer Science and Engineering, Shanghai Jiao Tong University

この論文をさがす

抄録

Given specified parameters, the number of check nodes, the expected girth and the variable node degrees, the Progressive Weight-Growth (PWG) algorithm is proposed to generate high rate low-density parity-check (LDPC) codes. Based on the theoretic foundation that is to investigate the girth impact by adding/removing variable nodes and edges of the Tanner graph, the PWG progressively increases column weights of the parity check matrix without violating the constraints defined by the given parameters. The analysis of the computational complexity and the simulation of code performance show that the LDPC codes by the PWG provide better or comparable performance in comparison with LDPC codes by some well-known methods (e.g., Mackay's random constructions, the PEG algorithm, and the bit-filling algorithm).

収録刊行物

参考文献 (6)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ