Efficient encoding of quasi-cyclic low-density parity-check codes

被引：324

作者：

Li, ZW ^{[1
]}

Chen, L

Zeng, LQ

Lin, S

Fong, WH

机构：

[1] Carnegie Mellon Univ, DSSC, Pittsburgh, PA 15213 USA

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

[3] NASA, Goddard Space Flight Ctr, Greenbelt, MD 20771 USA

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 2006年 / 54卷 / 01期

基金：

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

关键词：

array of circulants; quasi-cyclic (QQ low-density parity-check (LDPC) codes; systematic-circulant (SC) form;

D O I：

10.1109/TCOMM.2005.861667

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of LDPC codes. These codes have encoding advantage over other types of LDPC codes. This paper addresses the issue of efficient encoding of QC-LDPC codes. Two methods are presented to find the generator matrices of QC-LDPC codes in systematic-circulant (SC)form from their parity-check matrices, given in circulant form. Based on the SC form of the generator matrix of a QC-LDPC code, various types of encoding circuits using simple shift registers are devised. It is shown that the encoding complexity of a QC-LDPC code is linearly proportional to the number of parity bits of the code for serial encoding, and to the length of the code for high-speed parallel encoding.

引用

页码：71 / 81

页数：11

共 25 条

[21]

Tanner R. M., 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), DOI 10.1109/ISIT.2001.936089

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