PWG: Progressive Weight-Growth Algorithm for LDPC Codes

Xiangxue LI  Qingji ZHENG  Haifeng QIAN  Dong ZHENG  Kefei CHEN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E97-A   No.2   pp.685-689
Publication Date: 2014/02/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E97.A.685
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
LDPC code,  girth,  progressive weight growth,  

Full Text: PDF>>
Buy this Article

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).