Extended PEG Algorithm for high rate LDPC codes

被引：3

作者：

Zhou, Zhiheng ^{[2
]}

Li, Xiangxue ^{[1
]}

Zheng, Dong ^{[1
]}

Chen, Kefei ^{[2
]}

Li, Jianhua

机构：

[1] Shanghai Jiao Tong Univ, Sch Informat Secur Engn, Shanghai Key Lab Informat Secur Management & Tech, Shanghai, Peoples R China

[2] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai, Peoples R China

来源：

2009 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING WITH APPLICATIONS, PROCEEDINGS | 2009年

关键词：

CAPACITY;

D O I：

10.1109/ISPA.2009.80

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Progressive Edge-Growth(PEG) Algorithm is a good candidate to generate Tanner Graphs with a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. In this paper, we propose an extended PEG algorithm for constructing Low-Density Parity-Check (LDPC) codes with very high rate when given a lower bound of girth. Simulation results show the bit error rates of constructed LDPC codes with very high rate or large girth.

引用

页码：494 / 498

页数：5

共 8 条

[1] [Anonymous], 1963, Low-Density Parity-Check Codes
[2] Regular and irregular progressive edge-growth tanner graphs
Hu, XY
Eleftheriou, E
Arnold, DM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) : 386 - 398
[3] MacKay D.J.C., ENCY SPARSE GRAPH CO
[4] Near Shannon limit performance of low density parity check codes
MacKay, DJC
Neal, RM
[J]. ELECTRONICS LETTERS, 1996, 32 (18) : 1645 - 1646
[5] Design of capacity-approaching irregular low-density parity-check codes
Richardson, TJ
Shokrollahi, MA
Urbanke, RL
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 619 - 637
[6] The capacity of low-density parity-check codes under message-passing decoding
Richardson, TJ
Urbanke, RL
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 599 - 618
[7] *S P MICR, LOD IDPC ONL DENS EV
[8] On construction of rate-compatible low-density parity-check codes
Yazdani, M
Banihashemi, AH
[J]. 2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, : 430 - 434

← 1 →