Novel Types of Cyclically-Coupled Quasi-Cyclic LDPC Block Codes

被引：0

作者：

Lau, Francis C. M. ^{[1
,2
]}

Mo, Fanlu ^{[1
]}

Lu, Qing ^{[1
]}

Tam, Wai M. ^{[1
]}

Sham, Chiu-Wing ^{[1
]}

机构：

[1] Hong Kong Polytech Univ, Dept Elect & Informat Engn, Hong Kong, Hong Kong, Peoples R China

[2] Hong Kong Polytech Univ, Shenzhen Res Inst, Hong Kong, Hong Kong, Peoples R China

来源：

PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON ADVANCED TECHNOLOGIES FOR COMMUNICATIONS (ATC) | 2016年

关键词：

PARITY-CHECK CODES; ABSORBING SETS; BOUNDS;

D O I：

暂无

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

Cyclically-coupled quasi-cyclic LDPC (CC-QC-LDPC) block codes have been shown to achieve outstanding bit error performance with extremely low error floor. In this paper, we propose two new types of CC-QC-LDPC block codes which can achieve a larger girth. We present the error performance of the CC-QC-LDPC codes constructed by the new mechanism. We show that with similar codelengths, the new codes outperform the original CC-QC-LDPC codes by 0.3 to 0.35 dB at a bit error rate of 10(-12).

引用

页码：27 / 31

页数：5

共 24 条

[1] On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
Chung, SY
Forney, GD
Richardson, TJ
Urbanke, R
[J]. IEEE COMMUNICATIONS LETTERS, 2001, 5 (02) : 58 - 60
[2] Di CY, 2002, IEEE T INFORM THEORY, V48, P1570, DOI 10.1109/TIT.2002.1003839
[3] Dolecek Lara, 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing (ISTC 2010), P477, DOI 10.1109/ISTC.2010.5613896
[4] Analysis of absorbing sets for array-based LDPC codes
Dolecek, Lara
Zhang, Zhengya
Anantharam, Venkat
Wainwright, Martin
Nikolic, Borivoje
[J]. 2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 6261 - 6268
[5] Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes
Dolecek, Lara
Zhang, Zhengya
Anantharam, Venkat
Wainwright, Martin J.
Nikolic, Borivoje
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (01) : 181 - 201
[6] Predicting Error Floors of Structured LDPC Codes: Deterministic Bounds and Estimates
Dolecek, Lara
Lee, Pamela
Zhang, Zhengya
Anantharam, Venkat
Nikolic, Borivoje
Wainwright, Martin
[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (06) : 908 - 917
[7] Time-varying periodic convolutional codes with low-density parity-check matrix
Felstrom, AJ
Zigangirov, KS
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) : 2181 - 2191
[8] LOW-DENSITY PARITY-CHECK CODES
GALLAGER, RG
[J]. IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01): : 21 - &
[9] 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
[10] Improved progressive-edge-growth (PEG) construction of irregular LDPC codes
Hua, X
Banihashemi, AH
[J]. IEEE COMMUNICATIONS LETTERS, 2004, 8 (12) : 715 - 717

← 1 2 3 →