On the Design of Block Lengths for Irregular LDPC Codes Based on the Maximum Variable Degree 


Vol. 35,  No. 11, pp. 907-910, Nov.  2010


PDF
  Abstract

This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree dv,max. To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths (5×10²≤N≤4×10³). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree dv,max. We also present some simulation results which show how a block length can be optimized.

  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, "On the Design of Block Lengths for Irregular LDPC Codes Based on the Maximum Variable Degree," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 11, pp. 907-910, 2010. DOI: .

[ACM Style]

Kyuhyuk Chung. 2010. On the Design of Block Lengths for Irregular LDPC Codes Based on the Maximum Variable Degree. The Journal of Korean Institute of Communications and Information Sciences, 35, 11, (2010), 907-910. DOI: .

[KICS Style]

Kyuhyuk Chung, "On the Design of Block Lengths for Irregular LDPC Codes Based on the Maximum Variable Degree," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 11, pp. 907-910, 11. 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