Improved Performance Decoding for LDPC Codes with a Large Number of Short Cycles 


Vol. 33,  No. 2, pp. 173-177, Feb.  2008


PDF
  Abstract

In this paper, we improve performance of Low Density Parity Check (LDPC) codes with adding a large number of short cycles. Short cycles, especially cycles of length 4, degrade performance of LDPC codes if the standard BP (Belief Propagation) decoding is used. Therefore current researches have focused on removing cycles of length 4 for designing good performance LDPC codes. We found that a large number of cycles of length 4 improve performance of LDPC codes if a modified BP decoding is used. We present the modified BP decoding algorithm for LDPC codes with a large number of short cycles. We show that the modified BP decoding performance of LDPC codes with a large number of short cycles is better than the standard BP decoding performance of LDPC codes designed by avoiding short cycles.

  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, "Improved Performance Decoding for LDPC Codes with a Large Number of Short Cycles," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 2, pp. 173-177, 2008. DOI: .

[ACM Style]

Kyuhyuk Chung. 2008. Improved Performance Decoding for LDPC Codes with a Large Number of Short Cycles. The Journal of Korean Institute of Communications and Information Sciences, 33, 2, (2008), 173-177. DOI: .

[KICS Style]

Kyuhyuk Chung, "Improved Performance Decoding for LDPC Codes with a Large Number of Short Cycles," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 2, pp. 173-177, 2. 2008.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880