Diversity of non-binary cluster-LDPC codes using the EMS algorithm

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of electronics and communications Ročník 69; číslo 2; s. 492 - 499
Hlavní autoři: Shams, B., Declercq, D., Heinrich, V.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier GmbH 01.02.2015
Elsevier
Témata:
Computer Science
Diversity
Extended Min-Sum
Information Theory
Low complexity decoding algorithm
Non-binary LDPC dodes
Tanner graph
Low complexity decoding algorithm
Extended Min-Sum
Tanner graph
Diversity
Non-binary LDPC dodes
ISSN:1434-8411, 1618-0399
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1434-8411
1618-0399
DOI:10.1016/j.aeue.2014.10.014