Large Girth Quasi-Cyclic LDPC Codes Based on the Chinese Remainder Theorem

被引：22

作者：

Jiang, Xueqin ^{[1
]}

Lee, Moon Ho ^{[1
]}

机构：

[1] Chonbuk Natl Univ, Inst Informat & Commun, Chonju 561756, South Korea

来源：

IEEE COMMUNICATIONS LETTERS | 2009年 / 13卷 / 05期

基金：

新加坡国家研究基金会;

关键词：

LDPC codes; quasi-cyclic; array codes; shortened array codes; Chinese Remainder Theorem (CRT); girth; PARITY-CHECK CODES; COMBINING METHOD; MATRICES;

D O I：

10.1109/LCOMM.2009.082115

中图分类号：

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

学科分类号：

0809 ;

摘要：

In this letter, we consider two problems associated with quasi-cyclic low-density parity-check (QC-LDPC) codes. The first is how to extend the code length of a QC-LDPC code without reducing the girth. The second is how to design a QC-LDPC code with a prescribed girth easily. We deal with these two problems by using a combining method of QC-LDPC codes via the Chinese Remainder Theorem (CRT). Codes constructed with our proposed method have flexible code lengths, flexible code rates and large girth. Simulation results show that they perform very well with the iterative decoding.

引用

页码：342 / 344

页数：3

共 9 条

[1]

Fan J. L., 2000, PROC 2 INT S TURBO C, P553

[2] Quasi-cyclic low-density parity-check codes from circulant permutation matrices [J].

Fossorier, MPC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) :1788-1793

[3] LOW-DENSITY PARITY-CHECK CODES [J].

GALLAGER, RG .

IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&

[4] Generalized combining method for design of quasi-cyclic LDPC codes [J].

Liu, Yuanhua ;

Wang, Xinmei ;

Chen, Ruwei ;

He, Yucheng .

IEEE COMMUNICATIONS LETTERS, 2008, 12 (05) :392-394

[5] Near Shannon limit performance of low density parity check codes [J].

MacKay, DJC ;

Neal, RM .

ELECTRONICS LETTERS, 1996, 32 (18) :1645-1646

[6]

MILENKOVIC O, 2006, IEEE T INFORM THEORY, V52

[7] A combining method of quasi-cyclic LDPC codes by the chinese remainder theorem [J].

Myung, S ;

Yang, KC .

IEEE COMMUNICATIONS LETTERS, 2005, 9 (09) :823-825

[8] Algebraic construction of sparse matrices with large girth [J].

O'Sullivan, ME .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :718-727

[9]

OSULLIVAN ME, 2005, P 43 ANN ALL C COMM

← 1 →