Construction of LDPC Codes Based on Circulant Permutation Matrices

[1] Hu X Y, Eleftheriou E, and Arnold D M. Regular andirregular progressive edge-growth tanner graphs[J].IEEE Trans.on Inf. Theory.2005, 51(1):386-398 [2] Mansour M M and Shanbhag N R. A novel designmethodology for high-performance programmable decodercores for AA-LDPC codes. SIPS03., Seoul, Aug. 2003: 29-34. [3] Kou Y, Lin S, and Fossorier M P C. Low-density parity-checkcodes based on finite geometries: A rediscovery and newresults[J].IEEE Trans. on Inf. Theory.2001, 47(7):2711-2736 [4] Djurdjevic I, Xu J, Abdel-Ghaffar K, and Lin S. A class oflow-density parity-check codes constructed based on Reed-Solomon codes with two information symbols[J].IEEE Comm.Lett.2003, 7(7):317-319 [5] Ammar B, Honary B, Kou Y, Xu J, and Lin S. Constructionof low-density parity-check codes based on balancedincomplete block designs[J].IEEE Trans. on Inf. Theory.2004,50(6):1257-1269 [6] Xu J, Zeng L, Lan L, Chen L, and Lin S. Construction oflow-density parity-check codes by superposition[J].IEEE Trans.on Comm.2005, 53(2):243-251 [7] Kim K S, Lee S H, Kim Y H, and Ahn J Y. Design of binaryLDPC code using cyclic shift matrices[J].Elec. Lett.2004, 40(5):325-326 [8] Fossorier M P C. Quasicyclic low-density parity-check codesfrom circulant permutation matrices[J].IEEE Trans. on Inf.Theory.2004, 50(8):1788-1793 [9] Myung Seho, Yang Kyeongcheol, and Kim Jaeyoel.Quasi-cyclic LDPC codes for fast encoding[J].IEEE Trans. onInf. Theory.2005, 51(8):2894-2901 [10] Li Z W and Kumar B V K V. A class of good quasi-cyclic low-density parity check codes based on progressive edge growthgraph. Signals.[J].Systems and Computers04., California.2004,:- [11] Chung S Y, Richardson T J, and Urbanke R L. Analysis ofsum-product decoding of low-density parity-check codesusing a Gaussian approximation[J].IEEE Trans. on Inform.Theory.2001, 47(2):657-670