logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Parallel weighted bit-flipping decoding

delete2007-08-01
delete48
PRE
AI
X
Xiaofu Wu *
C
Chunming Zhao
肖友 cover
肖友 (Xiaohu You)
DOI：10.1109/LCOMM.2007.070269delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A parallel weighted bit-flipping (PWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known serial weighted bit-flipping decoding, the PWBF decoding converges significantly faster but with little performance penalty. For decoding of finite-geometry LDPC codes, we demonstrate through examples that the proposed PWBF decoding converges in about 5 iterations with performance very close to that of the standard belief-propagation decoding.
Keywords:
belief-propagation (BP)
bit-flipping (BF) decoding
low-density parity-check (LDPC) codes

Journal

IEEE Communications Letters cover
IEEE Communications Letters
IF:
4.4
Papers:
1.3W
Citations:
2.2W

Organization

No organization information available