Reduced Complexity-and-Latency Variable-to-Check Residual Belief Propagation for LDPC Codes 


Vol. 34,  No. 6, pp. 571-577, Jun.  2009


PDF Full-Text
  Abstract

This paper proposes some new improved versions of node-wise VCRBP algorithm for low-density parity-check (LDPC) codes, called forced-convergence node-wise VCRBP algorithm and sign based node-wise VCRBP, both of which significatly reduce the decoding complexity and latency, with only negligible deterioration in error correcting 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. Kim and H. Song, "Reduced Complexity-and-Latency Variable-to-Check Residual Belief Propagation for LDPC Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 6, pp. 571-577, 2009. DOI: .

[ACM Style]

Jung-Hyun Kim and Hong-Yeop Song. 2009. Reduced Complexity-and-Latency Variable-to-Check Residual Belief Propagation for LDPC Codes. The Journal of Korean Institute of Communications and Information Sciences, 34, 6, (2009), 571-577. DOI: .

[KICS Style]

Jung-Hyun Kim and Hong-Yeop Song, "Reduced Complexity-and-Latency Variable-to-Check Residual Belief Propagation for LDPC Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 6, pp. 571-577, 6. 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