.png){kind=icon}
.png){kind=icon}
Return
An Implementation-Friendly Binary LDPC Decoding Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2010.01.080069.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce an implementation-friendly binary message-passing decoding method for low-density parity-check (LDPC) codes that does not require the degree information of variable nodes or degree dependent parameters. For hard-decision decoding, given its low-complexity, the implementation cost for variable node degree information is an important consideration. We develop an estimation method for the extrinsic error probability (EEP) as well as its analysis. The proposed method offers similar performance as the existing methods for time-invariant decoding in most cases, while it facilitates efficient circuit implementations of the LDPC decoder.
Keywords:
LDPC codes
iterative binary decoding
time-invariant decoding
time-variant decoding
code optimization
circuit implementation
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