Controlling the Error Floor in LDPC Decoding
暂无分享,去创建一个
[1] O. Milenkovic,et al. Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.
[2] Shu Lin,et al. A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols , 2003, IEEE Communications Letters.
[3] R. M. Tanner,et al. A Class of Group-Structured LDPC Codes , 2001 .
[4] Daniel J. Costello,et al. LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.
[5] Jingyu Kang,et al. An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes , 2011, IEEE Transactions on Communications.
[6] Lara Dolecek,et al. GEN03-6: Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation , 2006, IEEE Globecom 2006.
[7] Manabu Hagiwara,et al. Quasicyclic low-density parity-check codes from circulant permutation matrices , 2009, IEEE Transactions on Information Theory.
[8] Vincent C. Gaudet,et al. Degree-Matched Check Node Decoding for Regular and Irregular LDPCs , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.
[9] Chih-Chun Wang,et al. On the error-prone substructures for the binary-input ternary-output channel and its corresponding exhaustive search algorithm , 2012, 2012 IEEE International Conference on Communications (ICC).
[10] Paul H. Siegel,et al. Error Floor Approximation for LDPC Codes in the AWGN Channel , 2014, IEEE Trans. Inf. Theory.
[11] Shuai Zhang,et al. On the dynamics of the error floor behavior in regular LDPC codes , 2009, 2009 IEEE Information Theory Workshop.
[12] Chih-Chun Wang,et al. Finding the Exhaustive List of Small Fully Absorbing Sets and Designing the Corresponding Low Error-Floor Decoder , 2012, IEEE Transactions on Communications.
[13] R. Koetter,et al. On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles , 2001 .
[14] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[15] Emre Telatar,et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.
[16] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[17] Lara Dolecek,et al. Controlling LDPC Absorbing Sets via the Null Space of the Cycle Consistency Matrix , 2011, 2011 IEEE International Conference on Communications (ICC).
[18] Shashi Kiran Chilappagari,et al. On the Construction of Structured LDPC Codes Free of Small Trapping Sets , 2012, IEEE Transactions on Information Theory.
[19] David Declercq,et al. Trapping set enumerators for specific LDPC codes , 2010, 2010 Information Theory and Applications Workshop (ITA).
[20] D. Mackay,et al. Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .
[21] Lara Dolecek,et al. Lowering LDPC Error Floors by Postprocessing , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.
[22] Brendan J. Frey,et al. Signal-space characterization of iterative decoding , 2001, IEEE Trans. Inf. Theory.
[23] Khaled A. S. Abdel-Ghaffar,et al. Construction of LDPC codes for AWGN and binary erasure channels based on finite fields , 2005, IEEE Information Theory Workshop, 2005..
[24] Thomas J. Richardson,et al. Error Floors of LDPC Codes , 2003 .
[25] 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.
[26] Lara Dolecek,et al. Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes , 2009, IEEE Transactions on Information Theory.
[27] Shuai Zhang,et al. Causes and dynamics of LDPC error floors on AWGN channels , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).