Browse > Article

New Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes  

Kim Sung-Hwan (서울대학교 전기컴퓨터공학부 부호 및 암호연구실)
Jang Min-Ho (서울대학교 전기컴퓨터공학부 부호 및 암호연구실)
No Jong-Seon (서울대학교 전기컴퓨터공학부 부호 및 암호연구실)
Hong Song-Nam (한양대학교 전자통신컴퓨터공학부 부호 및 통신 연구실)
Shin Dong-Joon (한양대학교 전자통신컴퓨터공학부 부호 및 통신 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.31, no.4C, 2006 , pp. 310-317 More about this Journal
Abstract
In this paper, we propose a new sequential message-passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This new decoding algorithm shows better bit error rate(BER) performance than that of the conventional message-passing decoding algorithm, especially for small number of iterations. Analytical results tell us that as the number of partitioned subsets of check nodes increases, the BER performance becomes better. We also derive the recursive equations for mean values of messages at variable nodes by using density evolution with Gaussian approximation. Simulation results also confirm the analytical results.
Keywords
Low-density parity-check( LDPC) codes; density evolution; Gaussian approximation; message-passing decoding algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. G. Gallager, Low-density parity-check codes, Cambridge, MA: MIT Press 1963
2 F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, 'Factor graphs and the sum-product algorithm,' IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 533-547, Feb. 2001
3 T. Richardson and R. Urbanke, 'The capacity of low-density parity-check codes under message-passing decoding,' IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001   DOI   ScienceOn
4 M. Cocco, J. Dielissen, M. Heijligers, A. Hekstra, and J. Huisken, 'A scalable architecture for LDPC decoding,' in Proc. DATE '04, pp. 88-93, Feb. 2004
5 D. J. C. Mackay and R. M. Neal, 'Near Shannon limit performance of low density parity check codes,' IEEE Electron. Lett., vol. 32, no. 18, pp. 1645-1646, Aug. 1996   DOI   ScienceOn
6 S.-Y. Chung, On the construction of some capacity-approaching coding schemes, PhD thesis, MIT, Sept. 2000
7 M. Fossorier, 'Quasi-cyclic low-density parity-check codes from circulant permutation matrices,' IEEE Trans. Inform. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004   DOI   ScienceOn
8 R. Tanner, 'A recursive approach to low complexity code,' IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, Sept. 1981   DOI
9 T. Richardson, M. Shokrollahi, and R. Urbanke, 'Design of capacity-approaching irregular low-density parity-check codes,' IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001   DOI   ScienceOn