Upper Bounds of Maximum Likelihood (ML) Decoding Performance of a few Irregular LDPC Codes and Peak Degradation Analysis 


Vol. 34,  No. 11, pp. 1025-1028, Nov.  2009


PDF
  Abstract

This paper presents upper bounds of Maximum Likelihood (ML) decoding performance of a few irregular LDPC codes using the simple bound and ML input output weight distributions and it is shown that contrary to general opinion that as block length becomes longer, BP decoding performance becomes simply closer to ML decoding performance, before peak degradation, as block length becomes longer, BP decoding performance falls behind ML decoding performance more and after peak degradation, general opinion holds.

  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]

K. Chung, "Upper Bounds of Maximum Likelihood (ML) Decoding Performance of a few Irregular LDPC Codes and Peak Degradation Analysis," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 11, pp. 1025-1028, 2009. DOI: .

[ACM Style]

Kyuhyuk Chung. 2009. Upper Bounds of Maximum Likelihood (ML) Decoding Performance of a few Irregular LDPC Codes and Peak Degradation Analysis. The Journal of Korean Institute of Communications and Information Sciences, 34, 11, (2009), 1025-1028. DOI: .

[KICS Style]

Kyuhyuk Chung, "Upper Bounds of Maximum Likelihood (ML) Decoding Performance of a few Irregular LDPC Codes and Peak Degradation Analysis," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 11, pp. 1025-1028, 11. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880