Estimating BP Decoding Performance of Moderate-Length Irregular LDPC Codes with Sphere Bounds 


Vol. 35,  No. 7, pp. 594-597, Jul.  2010


PDF
  Abstract

This paper estimates belief-propagation (BP) decoding performance of moderate-length irregular low-density parity-check (LDPC) codes with sphere bounds. We note that for moderate-length(10³≤ N ≤ 4×10³) irregular LDPC codes, BP decoding performance, which is much worse than maximum likelihood (ML) decoding performance, is well matched with one of loose upper bounds, i.e., sphere bounds. We introduce the sphere bounding technique for particular codes, not average bounds. The sphere bounding estimation technique is validated by simulation results. It is also shown that sphere bounds and BP decoding performance of irregular LDPC codes are very close at bit-error-rates (BERs) Pb of practical importance(10?≤ Pb ≤10-4).

  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, "Estimating BP Decoding Performance of Moderate-Length Irregular LDPC Codes with Sphere Bounds," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 7, pp. 594-597, 2010. DOI: .

[ACM Style]

Kyuhyuk Chung. 2010. Estimating BP Decoding Performance of Moderate-Length Irregular LDPC Codes with Sphere Bounds. The Journal of Korean Institute of Communications and Information Sciences, 35, 7, (2010), 594-597. DOI: .

[KICS Style]

Kyuhyuk Chung, "Estimating BP Decoding Performance of Moderate-Length Irregular LDPC Codes with Sphere Bounds," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 7, pp. 594-597, 7. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880