Analysis of Performance according to LDPC Decoding Algorithms 


Vol. 37,  No. 11, pp. 972-978, Nov.  2012


PDF
  Abstract

LDPC (low density parity check) code shows near Shannon limit performance by iterative decoding based on sum-product algorithm (SPA). Message updating procedure between variable and check nodes in SPA is done by a scheduling method. LDPC code shows different performance according to scheduling schemes. The conventional researches have been shown that the shuffled BP (belief propagation) algorithm shows better performance than the standard BP algorithm although it needs less number of iterations. However the reason is not analyzed clearly. Therefore the reason of difference in performance according to LDPC decoding algorithms is analyzed in this paper. 4 cases according to satisfaction of parity check condition are considered and compared. As results, the difference in the updating procedure in a cycle in the parity check matrix is considered to be the main reason of performance difference.

  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]

T. H. Yoon, J. T. Park, E. K. Joo, "Analysis of Performance according to LDPC Decoding Algorithms," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 11, pp. 972-978, 2012. DOI: .

[ACM Style]

Tae Hyun Yoon, Jin Tae Park, and Eon Kyeong Joo. 2012. Analysis of Performance according to LDPC Decoding Algorithms. The Journal of Korean Institute of Communications and Information Sciences, 37, 11, (2012), 972-978. DOI: .

[KICS Style]

Tae Hyun Yoon, Jin Tae Park, Eon Kyeong Joo, "Analysis of Performance according to LDPC Decoding Algorithms," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 11, pp. 972-978, 11. 2012.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880