Construction of low-density parity-check convolutional codes through progressive edge-growth

被引：14

作者：

Chen, ZG ^{[1
]}

Bates, S ^{[1
]}

机构：

[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB, Canada

来源：

IEEE COMMUNICATIONS LETTERS | 2005年 / 9卷 / 12期

关键词：

error correction coding; convolutional codes; block codes;

D O I：

10.1109/LCOMM.2005.12006

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

In this letter, we propose a novel approach of constructing low-density parity-check convolutional codes (LDPC-CCs), based on the progressive edge-growth (PEG) algorithm. LDPC-CC related modifications are made upon the original PEG algorithm to generate the time-varying parity-check matrix. The proposed method can generate LDPC-CCs with large girth, and is flexible in handling codes with different parameters. Simulation results show that such codes have good performance.

引用

页码：1058 / 1060

页数：3

共 6 条

[1] A memory-based architecture for FPGA implementations of low-density parity-check convolutional decoders [J].

Bates, S ;

Block, G .

2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS, 2005, :336-339

[2] Time-varying periodic convolutional codes with low-density parity-check matrix [J].

Felstrom, AJ ;

Zigangirov, KS .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) :2181-2191

[3] Regular and irregular progressive edge-growth tanner graphs [J].

Hu, XY ;

Eleftheriou, E ;

Arnold, DM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :386-398

[4]

LENTMAIER M, 2001, PROBL PEREDACHI INF, V37, P15

[5] The capacity of low-density parity-check codes under message-passing decoding [J].

Richardson, TJ ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :599-618

[6] LDPC block and convolutional codes based on circulant matrices [J].

Tanner, RM ;

Sridhara, D ;

Sridharan, A ;

Fuja, TE ;

Costello, DJ .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (12) :2966-2984

← 1 →