Analysis of Bounding Performance for LDPC codes and Turbo - Like Codes 


Vol. 31,  No. 2, pp. 138-143, Feb.  2006


PDF
  Abstract

We present upper bounds for the maximum-likelihood decoding performance of particular LDPC codes and turbo-like codes with particular interleavers. Previous research developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption, which bound the performance averaged over all ensemble codes or all interleavers. Proposed upper bounds are based on the simple bound and estimated weight distributions including the exact several smallest distance terms because if either estimated weight distributions on their own or the exact several smallest distance terms only are used, an accurate bound can not be obtained.

  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, "Analysis of Bounding Performance for LDPC codes and Turbo - Like Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 2, pp. 138-143, 2006. DOI: .

[ACM Style]

Kyuhyuk Chung. 2006. Analysis of Bounding Performance for LDPC codes and Turbo - Like Codes. The Journal of Korean Institute of Communications and Information Sciences, 31, 2, (2006), 138-143. DOI: .

[KICS Style]

Kyuhyuk Chung, "Analysis of Bounding Performance for LDPC codes and Turbo - Like Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 2, pp. 138-143, 2. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880