| [1] Huang Liqun, Wang Yuliang, Gong Ping. An improved construction method of QC-LDPC codes based on the PEG Algorithm[C]//PACCS 2011. China: IEEE Press, 2011: 1-4.[2] Fan Zhiyong, Zhang Weibo, Liu Xingcheng, et al. An improved algorithm for constructing QC-LDPC codes based on the PEG algorithm[C]//ChinaCOM 2009. China: IEEE Press, 2009: 1-4.[3] Hu Xiaoyu, Eleftheriou E, Arnold D M. Regular and irregular progressive edge-growth tanner graphs[J]. IEEE Transactions on Information Theory, 2005, 51(2): 386-398.[4] He Huan, Xu Youyun, Cai Yueming. Irregular quasi-cyclic LDPC codes design with generalized ACE constraint[C]//2009 International Conference on Communications and Mobile Computing. China: IEEE Press, 2009: 196-199.[5] Li Jilong, Di Na, Yang Ming, et al. Construction of quasi cyclic LDPC with ACE constraint[C]//WCNIS 2010. China: IEEE Press, 2010: 90-93.[6] Xiao Hua, Amir H Banihashemi. Improved progressive-edge-growth (PEG) construction of irregular LDPC codes[J]. IEEE Communications Letters, 2004, 8(12): 715-717.[7] Myung S, K Yang, J Kim. Quasi-cyclic LDPC code construction with low error floor based on the IPEG algorithm[J]. IEEE Communications Letters, 2007, 11(7): 607-609.[8] Tao Tian, C Jones, J D Villasenor, et al. Selective avoidance of cycles in irregular LDPC code construction[J]. IEEE Transactions on Communications, 2004, 52(8): 1242-1247.[9] Fossorier M P C. Quasi cyclic low-density parity-check codes from circulant permutation matrices[J]. IEEE Transactions on Information Theory, 2004, 50(8): 1788-1793.[10] Kong Lingjun, Yang Xiao. Ruling out small stopping sets and small girth in Tanner graph of QC-LDPC[J]. Journal of Systems Engineering and Electronic, 2010, 21(1): 134-137. |
