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
相关论文
共 10 条
  • [1] DI C, 1948, IEEE T INFORM THEORY, P1570
  • [2] Eleftheriou E, 2002, 2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS, P1752, DOI 10.1109/ICC.2002.997149
  • [3] Fan J. L., 2000, 2nd International Symposium on Turbo Codes and Related Topics. Proceedings, P543
  • [4] FELDMAN J, 1951, IEEE T INFORM THEORY, P954
  • [5] Codes on graphs: Normal realizations
    Forney, GD
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 520 - 548
  • [6] MACKAY D, 2003, ELEC NOTES THEO COMP, V74
  • [7] Richardson T., 2003, P 41 ANN ALL C COMM
  • [8] Vasic B., 2005, Coding and Signal Processing for Magnetic Recording Systems
  • [9] On the minimum distance of array codes as LDPC codes
    Yang, KC
    Helleseth, T
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (12) : 3268 - 3271
  • [10] Zhang Z, 2006, GLOB TELECOMM CONF