High-Performance and Low-Complexity Decoding of High-Weight LDPC Codes 


Vol. 34,  No. 5, pp. 498-504, May  2009


PDF
  Abstract

A high-performance low-complexity decoding algorithm for LDPC codes is proposed in this paper, which has the advantages of both bit-flipping (BF) algorithm and sum-product algorithm (SPA). The proposed soft bit-flipping algorithm requires only simple comparison and addition operations for computing the messages between bit and check nodes, and the amount of those operations is also small. By increasing the utilization ratio of the computed messages and by adopting nonuniform quantization, the signal-to-noise ratio (SNR) gap to the SPA is reduced to 0.4dB at the frame error rate of 10-4 with only 5-bit assignment for quantization. LDPC codes with high column or row weights, which are not suitable for the SPA decoding due to the complexity, can be practically implemented without much worsening the error performance.

  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]

J. Cho and W. Sung, "High-Performance and Low-Complexity Decoding of High-Weight LDPC Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 5, pp. 498-504, 2009. DOI: .

[ACM Style]

Junho Cho and Wonyong Sung. 2009. High-Performance and Low-Complexity Decoding of High-Weight LDPC Codes. The Journal of Korean Institute of Communications and Information Sciences, 34, 5, (2009), 498-504. DOI: .

[KICS Style]

Junho Cho and Wonyong Sung, "High-Performance and Low-Complexity Decoding of High-Weight LDPC Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 5, pp. 498-504, 5. 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