Browse > Article

Efficient Design of Structured LDPC Codes  

Chung Bi-Woong (연세대학교 전기전자공학과 부호 및 정보이론 연구실)
Kim Joon-Sung (연세대학교 전기전자공학과 부호 및 정보이론 연구실)
Song Hong-Yeop (연세대학교 전기전자공학과 부호 및 정보이론 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.31, no.1C, 2006 , pp. 14-19 More about this Journal
Abstract
The high encoding complexity of LDPC codes can be solved by designing structured parity-check matrix. If the parity-check matrix of LDPC codes is composed of same type of blocks, decoder implementation can be simple, this structure allow structured decoding and required memory for storing the parity-check matrix can be reduced largely. In this parer, we propose a construction algorithm for short block length structured LDPC codes based on girth condition, PEG algorithm and variable node connectivity. The code designed by this algorithm shows similar performance to other codes without structured constraint in low SNR and better performance in high SNR than those by simulation
Keywords
LDPC codes; circulant permutation matrix; girth; Progressive Edge Growth(PEG); Approximate Cycle EMD(ACE);
Citations & Related Records
연도 인용수 순위
  • Reference
1 Hua Xiao and Amir H. Banihasemi, 'Impro- ved Progressive-Edge-Growth(PEG) Construction of Irregular LDPC Codes,' IEEE Trans. Commun., vol. 8, pp. 715-717, Dec. 2004
2 T. Tian, C. Jones, 1. D. Villasenor, and R. D. Wesel, 'Selective Avoidance of Cycles in Irregular LDPC Code Construction,' IEEE Trans. Commun, vol. 52, pp. 12421247, Aug. 2004   DOI   ScienceOn
3 X. Hu, E. Eleftheriou, and D.-M. Arnold, 'Progressive Edge-Growth Tanner Graphs,' in IEEE GlobeCom, vol. 2, pp. 995-1001, Nov. 2001
4 A. Ramamoorthy, R. Wesel, 'Construction of short block length irregular low-density parity-check codes,' IEEE Trans. Commun, vol. 1, pp. 410-414, June. 2004
5 S. Lin, L. Chen, J. Xu, and I. Djurdjevic, 'Near Shannon limit quasi-cyclic low-density parity-check codes,' IEEE Trans. Inform. Theory, vol. 50, pp. 2030-2035, June. 2003
6 D. J. C. MacKay, R. M. Neal, 'Near Shannon limit performance of low-density parity-check codes,' Electron. Lett., vol. 33, pp.457-458, Mar. 1997   DOI   ScienceOn
7 T. Richardson, A. Shokrollahi, and R. Urbanke, 'Design of capacity-approaching irregular low-density parity-check codes,' IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Fer. 2001   DOI   ScienceOn
8 Thomas J. Richardson and R. L. Urbanke, 'Efficient Encoding of Low-Density Parity-Check Codes,' IEEE Trans. IT, vol. 47, pp. 638-656, Feb. 2001   DOI   ScienceOn
9 Michael Yang, 'Design of Efficiently Encodable Moderate-Length High-Rate Irregular LDPC Codes,' IEEE Trans. comm, Vol. 52. pp. 564-571, April. 2004   DOI   ScienceOn
10 David J. C. Mackay, 'Good error-correcting codes based on very sparse matrices,' IEEE Trans. IT, vol. 45, pp. 399-431, Mar. 1999   DOI   ScienceOn
11 R. G. Gallager, 'Low-density parity-check codes,' IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962