.png){kind=icon}
.png){kind=icon}
Return
Diversity of non-binary cluster-LDPC codes using the EMS algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.aeue.2014.10.014.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a new decoding procedure for non-binary cluster-LDPC codes based on the observation that different non-binary Tanner graphs for the same binary code may result in different convergence behaviours. We apply this concept locally at the check nodes and use multiple instances of a check node in parallel. Their outputs are joined together to get a single extrinsic message for each edge of the node. Each instance uses the famous Extended-Min-Sum (EMS) algorithm with very low complexity. We are able to obtain better decoding performance in the error-floor region with equal or lower complexity. We obtain the results via Mont-Carlo simulations and we make a comparison of the complexities as well. (C) 2014 Elsevier GmbH. All rights reserved.
Keywords:
Low complexity decoding algorithm
Extended Min-Sum
Non-binary LDPC dodes
Diversity
Tanner graph
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
A
IF:
3.2
Papers:
5.5K
Citations:
8.3K