.png){kind=icon}
.png){kind=icon}
Return
An Improved Decoding Algorithm for Finite-Geometry LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2009.02.060352.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, an improved bit-flipping decoding algorithm for high-rate finite-geometry low-density parity-check (FG-LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.
Keywords:
Belief propagation algorithm
bit-flipping (BF)
decoding algorithms
low-density parity-check (LDPC) codes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W