Irregular Quasi-Cyclic LDPC Codes Design with Generalized ACE Constraint
暂无分享,去创建一个
[1] Tong Zhang,et al. Block-LDPC: a practical LDPC coding system design approach , 2005, IEEE Trans. Circuits Syst. I Regul. Pap..
[2] Shu Lin,et al. Construction of low-density parity-check codes by superposition , 2005, IEEE Transactions on Communications.
[3] Richard D. Wesel,et al. Selective avoidance of cycles in irregular LDPC code construction , 2004, IEEE Transactions on Communications.
[4] Kyeongcheol Yang,et al. Quasi-cyclic LDPC codes for fast encoding , 2005, IEEE Transactions on Information Theory.
[5] Thomas J. Richardson,et al. Error Floors of LDPC Codes , 2003 .
[6] Marc P. C. Fossorier,et al. Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.
[7] Shu Lin,et al. Near-Shannon-limit quasi-cyclic low-density parity-check codes , 2003, IEEE Transactions on Communications.
[8] Dejan Vukobratovic,et al. ACE Spectrum of LDPC Codes and Generalized ACE Design , 2007, 2007 IEEE International Conference on Communications.
[9] Chanho Lee,et al. Design of Encoder and Decoder for LDPC Codes Using Hybrid H‐Matrix , 2005 .
[10] Evangelos Eleftheriou,et al. Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[11] Shu Lin,et al. Near-Shannon-limit quasi-cyclic low-density parity-check codes , 2004, IEEE Trans. Commun..
[12] Evangelos Eleftheriou,et al. Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.
[13] Dejan Vukobratovic,et al. Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design , 2008, IEEE Communications Letters.