.png){kind=icon}
.png){kind=icon}
Return
Constructing LDPC codes by error minimization progressive edge growth
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2008.050658.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A novel approach to constructing Tanner graphs using progressive edge growth (PEG) is introduced. It yields LDPC codes providing minimized block error probability in Binary Erasure Channels (BEC). The constructed codes exhibit superior performance over codes generated by previously known algorithms, both for BEC and AWGN channels. Furthermore, an upper bound on the expected block error probability in the error floor region of the generated codes is derived. This allows analytical prediction of the codes' error floor performance. Finally, the method. is generalized for generating simple in implementation LDPC codes based on lifted graphs.
Keywords:
LDPC codes
progressive edge growth (PEG)
error floor
stopping sets
trapping sets
lifted graphs
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