Lowering the Error Floor of LDPC Codes Using Cyclic Liftings

被引:68
作者
Asvadi, Reza [1 ]
Banihashemi, Amir H. [2 ]
Ahmadian-Attari, Mahmoud [1 ]
机构
[1] KN Toosi Univ Technol, Dept Elect & Comp Engn, Tehran, Iran
[2] Carleton Univ, Dept Syst & Comp Engn, Broadband Commun & Wireless Syst BCWS Ctr, Ottawa, ON K1S 5B6, Canada
关键词
Cyclic lifting; error floor; graph lifting; graph covering; low-density parity-check (LDPC) codes; trapping sets; PARITY-CHECK CODES; CAPACITY; SETS;
D O I
10.1109/TIT.2011.2110150
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cyclic liftings are proposed to lower the error floor of low-density parity-check (LDPC) codes. The liftings are designed to eliminate dominant trapping sets of the base code by removing the short cycles which are part of the trapping sets. We derive a necessary and sufficient condition for the cyclic permutations assigned to the edges of a cycle xi of length l(xi) in the base graph such that the inverse image of xi in the lifted graph consists of only cycles of length strictly larger than l(xi). The proposed method is universal in the sense that it can be applied to any LDPC code over any channel and for any iterative decoding algorithm. It also preserves important properties of the base code such as degree distributions, and in some cases, the code rate. The constructed codes are quasi-cyclic and thus attractive from a practical point of view. The proposed method is applied to both structured and random codes over the binary symmetric channel (BSC). The error floor improves consistently by increasing the lifting degree, and the results show significant improvements in the error floor compared to the base code, a random code of the same degree distribution and block length, and a random lifting of the same degree. Similar improvements are also observed when the codes designed for the BSC are applied to the additive white Gaussian noise (AWGN) channel.
引用
收藏
页码:2213 / 2224
页数:12
相关论文
共 33 条
[1]  
[Anonymous], 1963, Low-Density Parity-Check Codes
[2]  
[Anonymous], PROCEEDINGS OF THE I
[3]  
Bazzi L, 2004, IEEE T INFORM THEORY, V50, P2010, DOI 10.1109/TIT.2004.833352
[4]  
Chilappagari SK, 2006, IEEE ICC, P1089
[5]   Instanton-Based Techniques for Analysis and Reduction of Error Floors of LDPC Codes [J].
Chilappagari, Shashi Kiran ;
Chertkov, Michael ;
Stepanov, Mikhail G. ;
Vasic, Bane .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (06) :855-865
[6]  
Cole C. A., 2006, IEEE T INF THEORY
[7]  
Di CY, 2002, IEEE T INFORM THEORY, V48, P1570, DOI 10.1109/TIT.2002.1003839
[8]   Capacity-Approaching Protograph Codes [J].
Divsalar, Dariush ;
Dolinar, Sam ;
Jones, Christopher R. ;
Andrews, Kenneth .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (06) :876-888
[9]   Predicting Error Floors of Structured LDPC Codes: Deterministic Bounds and Estimates [J].
Dolecek, Lara ;
Lee, Pamela ;
Zhang, Zhengya ;
Anantharam, Venkat ;
Nikolic, Borivoje ;
Wainwright, Martin .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (06) :908-917
[10]   Quasi-cyclic low-density parity-check codes from circulant permutation matrices [J].
Fossorier, MPC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) :1788-1793