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 条

[41] On Absorbing Sets of Structured Sparse Graph Codes
Dolecek, Lara
2010 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2010, : 107 - 111
[42] Absorbing sets of codes from finite geometries
Beemer, Allison
Haymaker, Kathryn
Kelley, Christine A.
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (05): : 1115 - 1131
[43] Lower Bounds for Quantized LDPC Min-Sum Decoders Based on Absorbing Sets
Hatami, Homayoon
Mitchell, David G. M.
Costello, Daniel J., Jr.
Fuja, Thomas
2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 694 - 699
[44] Comparison of the Detrimental Effects of Trapping Sets in LDPC Codes
Deka, Kuntal
Rajesh, A.
Bora, P. K.
2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
[45] Array-based pyrosequencing
Gharizadeh, Baback
Goel, Sanket
Eltoukhy, Helmy
Agah, Mohsen Nemat -Corgani Ali
Babrzadeh, Farbod
Jalili, Roxana
Talasaz, Amir -Ali H.
Davis, Ronald W.
Ronaghi, Mostafa
PROGRESS ON POST-GENOME TECHNOLOGIES, 2007, : 8 - 9
[46] On the hardness of approximating stopping and trapping sets in LDPC codes
McGregor, Andrew
Milenkovic, Olgica
2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2, 2007, : 248 - +
[47] Protograph LDPC codes design based on EXIT analysis
Liva, Gianluigi
Chiani, Marco
GLOBECOM 2007: 2007 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-11, 2007, : 3250 - +
[48] Cooperative Relay Channel with LDPC Codes Constructed from Array Codes
Somphruek, Mingkwan
Carrasco, Rolando
Le Goff, Stephane
WTS: 2009 WIRELESS TELECOMMUNICATIONS SYMPOSIUM, 2009, : 161 - 166
[49] On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes
Chilappagari, Shashi Kiran
Nguyen, Dung Viet
Vasic, Bane
Marcellin, Michael W.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (04) : 1600 - 1611
[50] A lectin array-based methodology for the analysis of protein glycosylation
Rosenfeld, Rakefet
Bangio, Haim
Gerwig, Gerrit J.
Rosenberg, Revital
Aloni, Ronny
Cohen, Yossi
Amor, Yehudit
Plaschkes, Inbar
Kamerling, Johannis P.
Maya, Ruth Ben-Yakar
JOURNAL OF BIOCHEMICAL AND BIOPHYSICAL METHODS, 2007, 70 (03): : 415 - 426

← 1 2 3 4 5 →