A Unified Approach to the Construction of Binary and Nonbinary Quasi-Cyclic LDPC Codes Based on Finite Fields

被引：77

作者：

Song, Shumei ^{[1
]}

Zbou, Bo ^{[1
]}

Lin, Shu ^{[1
]}

Abdel-Ghaffar, Khaled ^{[1
]}

机构：

[1] Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 2009年 / 57卷 / 01期

基金：

美国国家科学基金会; 美国国家航空航天局;

关键词：

Base matrix; dispersion; finite field; LDPC codes; location-vector; quasi-cyclic; PARITY-CHECK CODES; REED-SOLOMON CODES; MATRICES; CHANNELS; CAPACITY; DESIGN;

D O I：

10.1109/TCOMM.2009.0901.060129

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A unified approach for constructing binary and nonbinary quasi-cyclic LDPC codes under a single framework is presented. Six classes of binary and nonbinary quasi-cyclic LDPC codes are constructed based on primitive elements, additive subgroups, and cyclic subgroups of finite fields. Numerical results show that the codes constructed perform well over the AWGN channel with iterative decoding.

引用

页码：84 / 93

页数：10

共 33 条

[21] Good error-correcting codes based on very sparse matrices [J].

MacKay, DJC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :399-431

[22]

MacKay DJC, 2001, IMA VOL MATH APPL, V123, P113

[23]

MASSEY JL, 1969, IEEE T INFORM THEORY, V15, P122, DOI 10.1109/TIT.1969.1054260

[24]

Richardson T. J., 2003, P 41 ANN ALL C COMM, P1426

[25] Efficient encoding of low-density parity-check codes [J].

Richardson, TJ ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :638-656

[26] Design of capacity-approaching irregular low-density parity-check codes [J].

Richardson, TJ ;

Shokrollahi, MA ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :619-637

[27] 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

[28]

Smarandache R, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P274

[29] A RECURSIVE APPROACH TO LOW COMPLEXITY CODES [J].

TANNER, RM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (05) :533-547

[30] 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 2 3 4 →