Decoding Method of LDPC Codes in IEEE 802.16e Standards for Improving the Convergence Speed 


Vol. 31,  No. 12, pp. 1143-1149, Dec.  2006


PDF
  Abstract

In this paper, the modified iterative decoding algorithm[8] by partitioning check nodes is applied to low-density parity-check(LDPC) codes in IEEE 802.16e standards, which gives us the improvement for convergence speed of decoding. Also, the new method of check node partitioning which is suitable for decoding of the LDPC codes in IEEE 802.16e system is proposed. The improvement of convergence speed in decoding reduces the number of iterations and thus the computational complexity of the decoder. The decoding method by partitioning check nodes can be applied to the LDPC codes whose decoder cannot be implemented in the fully parallel processing as an efficient sequential processing method. The modified iterative decoding method of LDPC codes using the proposed check node partitioning method can be used to implement the practical decoder in the wireless communication systems.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Jang, B. Shin, W. Park, J. No, I. Jeon, "Decoding Method of LDPC Codes in IEEE 802.16e Standards for Improving the Convergence Speed," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 12, pp. 1143-1149, 2006. DOI: .

[ACM Style]

Min-Ho Jang, Beom-Kyu Shin, Woo-Myoung Park, Jong-Seon No, and In-San Jeon. 2006. Decoding Method of LDPC Codes in IEEE 802.16e Standards for Improving the Convergence Speed. The Journal of Korean Institute of Communications and Information Sciences, 31, 12, (2006), 1143-1149. DOI: .

[KICS Style]

Min-Ho Jang, Beom-Kyu Shin, Woo-Myoung Park, Jong-Seon No, In-San Jeon, "Decoding Method of LDPC Codes in IEEE 802.16e Standards for Improving the Convergence Speed," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 12, pp. 1143-1149, 12. 2006.