A reduced-complexity iterative scheme for decoding quasi-cyclic low-density parity-check codes
暂无分享,去创建一个
Khaled A. S. Abdel-Ghaffar | Juane Li | Shu Lin | Keke Liu | Shu Lin | K. Abdel-Ghaffar | Juane Li | Keke Liu
[1] J. Thorpe. Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .
[2] Qin Huang,et al. Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares , 2010, IEEE Transactions on Communications.
[3] 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.
[4] Qiuju Diao,et al. A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes , 2012, IEEE Transactions on Information Theory.
[5] Shu Lin,et al. Near-Shannon-limit quasi-cyclic low-density parity-check codes , 2004, IEEE Trans. Commun..
[6] Evangelos Eleftheriou,et al. Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[7] Shu Lin,et al. Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.
[8] Dariush Divsalar,et al. Construction of Protograph LDPC Codes with Linear Minimum Distance , 2006, 2006 IEEE International Symposium on Information Theory.
[9] Bane V. Vasic,et al. Combinatorial constructions of low-density parity-check codes for iterative decoding , 2002, IEEE Transactions on Information Theory.
[10] Shu Lin,et al. Channel Codes: Classical and Modern , 2009 .
[11] Dariush Divsalar,et al. Capacity-approaching protograph codes , 2009, IEEE Journal on Selected Areas in Communications.
[12] Qin Huang,et al. Quasi-cyclic LDPC codes: an algebraic construction , 2010, IEEE Transactions on Communications.
[13] Keshab K. Parhi,et al. Overlapped message passing for quasi-cyclic low-density parity check codes , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.
[14] Shu Lin,et al. Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach , 2007, IEEE Transactions on Information Theory.
[15] Khaled A. S. Abdel-Ghaffar,et al. A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields , 2009, IEEE Transactions on Communications.
[16] Zongwang Li,et al. Efficient encoding of quasi-cyclic low-density parity-check codes , 2006, IEEE Trans. Commun..
[17] Evangelos Eleftheriou,et al. Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.
[18] Khaled A. S. Abdel-Ghaffar,et al. Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme , 2014, IEEE Transactions on Communications.
[19] Shu Lin,et al. Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking , 2007, IEEE Transactions on Information Theory.
[20] William Ryan,et al. Channel Codes: Classical and Modern , 2009 .
[21] William Ryan,et al. Channel Codes by William Ryan , 2009 .
[22] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[23] Khaled A. S. Abdel-Ghaffar,et al. Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels , 2006, IEEE Transactions on Communications.