IEICE TRANSACTIONS on Fundamentals
PWG: Progressive Weight-Growth Algorithm for LDPC Codes
Summary :
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).
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E97-A No.2 pp.685-689
- Publication Date
- 2014/02/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E97.A.685
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Xiangxue LI
East China Normal University,Xi'an University of Posts and Telecommunications
Qingji ZHENG
University of Texas at San Antonio
Haifeng QIAN
Xi'an University of Posts and Telecommunications
Dong ZHENG
Shanghai Jiao Tong University
Kefei CHEN
Shanghai Jiao Tong University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Xiangxue LI, Qingji ZHENG, Haifeng QIAN, Dong ZHENG, Kefei CHEN, "PWG: Progressive Weight-Growth Algorithm for LDPC Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 2, pp. 685-689, February 2014, doi: 10.1587/transfun.E97.A.685.
Abstract: 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).
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.685/_p
Copy
@ARTICLE{e97-a_2_685,
author={Xiangxue LI, Qingji ZHENG, Haifeng QIAN, Dong ZHENG, Kefei CHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={PWG: Progressive Weight-Growth Algorithm for LDPC Codes},
year={2014},
volume={E97-A},
number={2},
pages={685-689},
abstract={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).},
keywords={},
doi={10.1587/transfun.E97.A.685},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - PWG: Progressive Weight-Growth Algorithm for LDPC Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 685
EP - 689
AU - Xiangxue LI
AU - Qingji ZHENG
AU - Haifeng QIAN
AU - Dong ZHENG
AU - Kefei CHEN
PY - 2014
DO - 10.1587/transfun.E97.A.685
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2014
AB - 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).
ER -
English
