Design of irregular quasi-cyclic protograph codes with low error floors
暂无分享,去创建一个
[1] Amir H. Banihashemi,et al. Lowering the error floor of LDPC codes using cyclic liftings , 2010, 2010 IEEE International Symposium on Information Theory.
[2] R. M. Tanner,et al. A Class of Group-Structured LDPC Codes , 2001 .
[3] Dejan Vukobratovic,et al. Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design , 2008, IEEE Communications Letters.
[4] Dariush Divsalar,et al. Capacity-approaching protograph codes , 2009, IEEE Journal on Selected Areas in Communications.
[5] Shashi Kiran Chilappagari,et al. Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers , 2008, IEEE Transactions on Information Theory.
[6] Thomas J. Richardson,et al. Error Floors of LDPC Codes , 2003 .
[7] Richard D. Wesel,et al. Selective avoidance of cycles in irregular LDPC code construction , 2004, IEEE Transactions on Communications.
[8] Dejan Vukobratovic,et al. Transactions papers evaluation and design of irregular LDPC codes using ACE spectrum , 2009, IEEE Transactions on Communications.
[9] Hua Xiao,et al. Improved progressive-edge-growth (PEG) construction of irregular LDPC codes , 2004, IEEE Communications Letters.
[10] Evangelos Eleftheriou,et al. Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.