A Class of High-Rate Low-Complexity QC-LDPC Codes

Gallager R G. Low density parity check codes[J].IRE Trans. onInf. Theory.1962, 8(3):21-28[2]MacKay D J C. Good error-correcting codes based on verysparse matrices[J].IEEE Trans. on Inf. Theory.1999, 45(2):399-431[3]Li Zongwang, Chen Lei, and Zeng Lingqi, et al.. Efficientencoding of quasi-cyclic low-density parity-check codes[J].IEEE Trans. on Commun.2006, 54(1):71-81[4]Li Ping, Leung W K, and Phamdo N. Low density paritycheck codes with semi-random parity check matrix[J].Electron.Lett.1999, 35(1):38-39[5]Richardson T J and Urbanke R. Efficient encoding oflow-density parity-check codes[J].IEEE Trans. on Inf. Theory.2001, 47(2):638-656[6]姜明，赵春明，何善宝，等. 低复杂度的LDPC 码联合编译码构造方法研究. 通信学报, 2005, 26(2): 80-86.Jiang Ming, Zhao Chun-ming, and He Shan-bao, et al.. Jointencoding-decoding construction of LDPC codes. Journal onCommunications, 2005, 26(2): 80-86.[7]Myung Seho, Yang Kyeongcheol, and Kim Jaeyoel. QuasicyclicLDPC codes for fast encoding[J].IEEE Trans. on Inf.Theory.2005, 51(8):2894-2901[8]Xiao Yang and Lee Moon Ho. Low complexity MIMO-LDPCCDMA systems over multipath channels[J].IEICE Trans. onCommun.2006, E89-B(5):1713-1717[9]Kim K S, Lee S H, and Kim Y H, et al.. Design of binaryLDPC code using cyclic shift matrices[J].Electron. Lett.2004,40(5):325-326[10]Kou Y, Lin S, and Fossorier M. Low-density parity-checkcodes based on finite geometries: A rediscovery and newresults[J].IEEE Trans. on Inf. Theory.2001, 47(7):619-637[11]Xu J, Chen L, and Zeng L Q, et al.. Construction of lowdensityparity-check codes by superposition[J].IEEE Trans. onCommun.2005, 53(2):243-251[12]Ammar Bassem, Honary Bahram, and Kou Yu, et al..Construction of low-density parity-check codes based onbalanced incomplete block designs[J].IEEE Trans. on Inf.Theory.2004, 50(6):1257-1268[13]Fan J L. Array codes as low-density parity-check codes. Proc.2nd Int. Symp. Turbo Codes, Brest, France, 2000: 543-546.