Set Message-Passing Decoding Algorithms for Regular Non-Binary LDPC Codes

In the check node (CN) update of non-binary message-passing algorithms, each element of reliability vectors takes the same computational complexity. However, our analysis indicates that various elements in the same vector have various correct probabilities, thus have different contributions to error...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 65; no. 12; pp. 5110 - 5122
Main Authors: Huang, Qin, Song, Liyuan, Wang, Zulin
Format: Journal Article
Language:English
Published: New York IEEE 01.12.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithm design and analysis
Algorithms
Binary codes
Binary system
check node update
Codes
Complexity
Computation
Computational complexity
Computer simulation
Decoding
Error correcting codes
Error correction
fixed paths
Message passing
Non-binary LDPC codes
Parity check codes
Partitioning algorithms
Reliability
Reliability analysis
set partition
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the check node (CN) update of non-binary message-passing algorithms, each element of reliability vectors takes the same computational complexity. However, our analysis indicates that various elements in the same vector have various correct probabilities, thus have different contributions to error performance. In order to match computational complexity with correct probability, all elements in a vector are partitioned into different sets. For the extended min-sum (EMS) decoding, various strategies are applied for sets according to their correct probability. For the trellis-based EMS decoding, it is interesting that set partition only involves fixed paths, thus it does not need to search over the whole trellis of a CN. Complexity analysis and simulation results show that the proposed algorithms efficiently decode non-binary low-density parity-check codes, including ultra-sparse ones.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2017.2746101