.png){kind=icon}
Return
MB iterative decoding algorithm on systematic LDGM codes: Performance evaluation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2009.05.019.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We investigate the performance of regular systematic low-density generator matrix (LDGM) codes under the majority rule based (MB) iterative decoding algorithm. We derive a recursive form which can be used to extract the error performance of the code. Based on the recursive expression, we derive a tight non-recursive lower bound. These results can serve as efficient tools to evaluate the performance of the code for different degrees. (C) 2009 Elsevier B.V. All rights reserved.
Keywords:
Systematic LDGM codes
Majority-rule decoding
Performance bounds
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveEffective dose in low-dose CT compared with radiography for templating of total hip arthroplasty
PREAI
ShareSave
ShareSaveShareSave no more
no more