Construction of LDPC codes based on circulant permutation matrices

Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology

Volumn 30, Issue 10, 2008, Pages 2384-2387

  Qiao, Hua ^a   Guan, Wu ^a   Dong, Ming Ke ^a   Xiang, Hai Ge ^a  

^a PEKING UNIVERSITY   (China)

Author keywords

Circulant permutation matrices; Progressive Edge Growth (PEG) algorithm; Quasi Cyclic LDPC (QC LDPC) codes

Indexed keywords

GRAPHIC METHODS;

BIPARTITE GRAPHS; CODE LENGTH; CONSTRUCTION ALGORITHMS; PERMUTATION MATRIX; PROGRESSIVE-EDGE-GROWTH ALGORITHMS; QC LDPC CODES; QUASI-CYCLIC LDPC (QC-LDPC); SUB-MATRICES;

CONVOLUTIONAL CODES;

EID: 55649093051     PISSN: 10095896     EISSN: None     Source Type: Journal    
DOI: 10.3724/sp.j.1146.2007.00526     Document Type: Article

References (11)

1. Hu X Y, Eleftheriou E, and Arnold D M. Regular and irregular progressive edge-growth tanner graphs. IEEE Trans. on Inf. Theory, 2005, 51(1): 386-398.
2. Mansour M M and Shanbhag N R. A novel design methodology for high-performance programmable decoder cores for AA-LDPC codes. SIPS'03., Seoul, Aug. 2003: 29-34.
3. Kou Y, Lin S, and Fossorier M P C. Low-density parity-check codes based on finite geometries: A rediscovery and new results. IEEE Trans. on Inf. Theory, 2001, 47(7): 2711-2736.
4. Djurdjevic I, Xu J, Abdel-Ghaffar K, and Lin S. A class of low-density parity-check codes constructed based on Reed- Solomon codes with two information symbols. IEEE Comm. Lett., 2003, 7(7): 317-319.
5. Ammar B, Honary B, Kou Y, Xu J, and Lin S. Construction of low-density parity-check codes based on balanced incomplete block designs. IEEE Trans. on Inf. Theory, 2004, 50(6): 1257-1269.
6. Xu J, Zeng L, Lan L, Chen L, and Lin S. Construction of low-density parity-check codes by superposition. 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 binary LDPC code using cyclic shift matrices. Elec. Lett., 2004, 40(5): 325-326.
8. Fossorier M P C. Quasicyclic low-density parity-check codes from circulant permutation matrices. 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. IEEE Trans. on Inf. 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 growth graph. Signals, Systems and Computers'04., California, 2004: 1990-1994.
11. Chung S Y, Richardson T J, and Urbanke R L. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation. IEEE Trans. on Inform. Theory, 2001, 47(2): 657-670.