Analysis of absorbing sets for array-based LDPC codes

被引：32

作者：

Dolecek, Lara ^{[1
]}

Zhang, Zhengya ^{[1
]}

Anantharam, Venkat ^{[1
]}

Wainwright, Martin ^{[1
]}

Nikolic, Borivoje ^{[1
]}

机构：

[1] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA

来源：

2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14 | 2007年

关键词：

D O I：

10.1109/ICC.2007.1037

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

Low density parity check codes (LDPC) are known to perform very well under iterative decoding. However, these codes also exhibit a change in the slope of the bit error rate (BER) vs. signal to noise ratio (SNR) curve in the very low BER region. In our earlier work using hardware emulation in this deep BER regime we argue that this behavior can be attributed to specific structures within the Tanner graph associated with an LDPC code, called absorbing sets. In this paper we provide a detailed theoretical analysis of absorbing sets for array-based LDPC codes C-p,C-gamma. Specifically, we identify and enumerate all the smallest absorbing sets for these array-based LDPC codes with gamma = 2,3,4 with standard parity check matrix. Experiments carried out on the emulation platform show excellent agreement with our theoretical results.

引用

页码：6261 / 6268

页数：8

共 50 条

[21] On the minimum distance of array codes as LDPC codes
Yang, KC
Helleseth, T
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (12) : 3268 - 3271
[22] Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes
Ländner, S
Milenkovic, C
2005 International Conference on Wireless Networks, Communications and Mobile Computing, Vols 1 and 2, 2005, : 630 - 635
[23] Trapping Sets of Structured LDPC Codes
Huang, Qin
Diao, Qiuju
Lin, Shu
Abdel-Ghaffar, Khaled
2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1086 - 1090
[24] Decoder architecture for array-code-based LDPC codes
Ölçer, S
GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 2046 - 2050
[25] Analysis and Enumeration of Absorbing Sets for Non-Binary Graph-Based Codes
Amiri, Behzad
Kliewer, Joerg
Dolecek, Lara
IEEE TRANSACTIONS ON COMMUNICATIONS, 2014, 62 (02) : 398 - 409
[26] Analysis and Enumeration of Absorbing Sets for Non-Binary Graph-Based Codes
Amiri, Behzad
Kliewer, Jorg
Dolecek, Lara
2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2815 - +
[27] 4-Cycle Free LDPC Codes Based on Difference Sets
Esmaeili, M.
Javedankherad, M.
IEEE TRANSACTIONS ON COMMUNICATIONS, 2012, 60 (12) : 3579 - 3586
[28] Lower Error Floor of LDPC Codes Based on Trapping Sets Elimination
Dong, Le
Zhao, Ziyu
Lei, Jing
Li, Er-bao
2014 SIXTH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP), 2014,
[29] Performance Bounds for Quantized Spatially Coupled LDPC Decoders Based on Absorbing Sets
Hatami, Homayoon
Mitchell, David G. M.
Costello, Daniel J., Jr.
Fuja, Thomas
2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 826 - 830
[30] Generalized LDPC codes and generalized stopping sets
Miladinovic, Nenad
Fossorier, Marc P. C.
IEEE TRANSACTIONS ON COMMUNICATIONS, 2008, 56 (02) : 201 - 212

← 1 2 3 4 5 →