An efficient BF LDPC decoding algorithm based on a syndrome vote scheme

Jui Hui Hung*, Sau-Gee Chen

*Corresponding author for this work

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

Abstract

This work presents a high-performance bit-flipping (BF) algorithm utilizing a proposed syndrome vote technique of a defined culprit bit set, named CVBF algorithm for LDPC decoding. It can achieve significant decoding performance improvements by about 0.9dB over the most efficient BF algorithm, owing to the introduced an additional syndrome vote procedure after updating the flipping reliabilities of all the received bits in each iteration. Moreover, its performance is comparable to the min-sum algorithm (MSA) under the condition of same iteration number, but with much lower complexity per iteration. The proposed syndrome vote scheme only costs little overhead in hardware realization. Besides, an early termination strategy suited for the proposed algorithm is also devised to further reduce the iteration number. copyright

Original languageEnglish
Title of host publication2008 14th Asia-Pacific Conference on Communications, APCC 2008
StatePublished - 1 Dec 2008
Event2008 14th Asia-Pacific Conference on Communications, APCC 2008 - Akihabara, Tokyo, United States
Duration: 14 Oct 200816 Oct 2008

Publication series

Name2008 14th Asia-Pacific Conference on Communications, APCC 2008

Conference

Conference2008 14th Asia-Pacific Conference on Communications, APCC 2008
CountryUnited States
CityAkihabara, Tokyo
Period14/10/0816/10/08

Keywords

  • Bit flipping algorithm
  • Channel coding
  • LDPC code

Fingerprint Dive into the research topics of 'An efficient BF LDPC decoding algorithm based on a syndrome vote scheme'. Together they form a unique fingerprint.

  • Cite this

    Hung, J. H., & Chen, S-G. (2008). An efficient BF LDPC decoding algorithm based on a syndrome vote scheme. In 2008 14th Asia-Pacific Conference on Communications, APCC 2008 [4773790] (2008 14th Asia-Pacific Conference on Communications, APCC 2008).