Reduced complexity-and-latency variable-to-check residual belief propagation decoding algorithms for LDPC codes

Jung Hyun Kim, Hong Yeop Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper proposes some new improved versions of node-wise VCRBP algorithm, called forced-convergence node-wise VCRBP and sign-based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.

Original languageEnglish
Title of host publicationProceedings of the 4th International Workshop on Signal Design and Its Applications in Communications, IWSDA'09
Pages76-79
Number of pages4
DOIs
Publication statusPublished - 2009 Dec 1
Event4th International Workshop on Signal Design and Its Applications in Communications, IWSDA'09 - Fukuoka, Japan
Duration: 2009 Oct 192009 Oct 23

Publication series

NameProceedings of the 4th International Workshop on Signal Design and Its Applications in Communications, IWSDA'09

Other

Other4th International Workshop on Signal Design and Its Applications in Communications, IWSDA'09
CountryJapan
CityFukuoka
Period09/10/1909/10/23

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Signal Processing
  • Electrical and Electronic Engineering
  • Communication

Cite this

Kim, J. H., & Song, H. Y. (2009). Reduced complexity-and-latency variable-to-check residual belief propagation decoding algorithms for LDPC codes. In Proceedings of the 4th International Workshop on Signal Design and Its Applications in Communications, IWSDA'09 (pp. 76-79). [5346442] (Proceedings of the 4th International Workshop on Signal Design and Its Applications in Communications, IWSDA'09). https://doi.org/10.1109/IWSDA.2009.5346442