An improvement of approximate BP decoding

Gou Hosoya, Hiroyuki Yashima

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

Abstract

In this study, we present new methods for piece-wise linear approximation of Min-Sum (MS) decoding algorithm with good trade-off between performance and complexity. By analysis based on density evolution, the performance of the proposed method is identical to that of the Belief-Propagation decoding algorithm. The increment of the complexity of the proposed algorithm is small compared with the MS decoding algorithm. Moreover simulation result also shows effectiveness of the proposed algorithm.

Original languageEnglish
Title of host publicationProceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages186-190
Number of pages5
ISBN (Electronic)9784885522925
Publication statusPublished - 2014 Dec 8
Externally publishedYes
Event2014 International Symposium on Information Theory and Its Applications, ISITA 2014 - Melbourne, Australia
Duration: 2014 Oct 262014 Oct 29

Publication series

NameProceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014

Conference

Conference2014 International Symposium on Information Theory and Its Applications, ISITA 2014
CountryAustralia
CityMelbourne
Period14/10/2614/10/29

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'An improvement of approximate BP decoding'. Together they form a unique fingerprint.

  • Cite this

    Hosoya, G., & Yashima, H. (2014). An improvement of approximate BP decoding. In Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014 (pp. 186-190). [6979829] (Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014). Institute of Electrical and Electronics Engineers Inc..