Threshold-based extended minimum-sum algorithm for non-binary LDPC codes

In this paper, we propose a new improved algorithm to reduce the decoding complexity of NB-LDPC codes especially when the number of iteration is large. The proposed algorithm is based on the extended min-sum (EMS) which truncates the message vectors and trellis-based EMS (T-EMS) which employs the tr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International Conference on Wireless Communications and Signal Processing S. 1 - 5
Hauptverfasser: Ke Lai, Erbao Li, Jing Lei
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.10.2016
Schlagworte:
Buildings
Complexity theory
Decoding
delta domain message
Encoding
Extended Min-Sum
Galois fields
non-binary LDPC code
Parity check codes
Reliability
threshold
trellis representation
ISSN:2472-7628
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we propose a new improved algorithm to reduce the decoding complexity of NB-LDPC codes especially when the number of iteration is large. The proposed algorithm is based on the extended min-sum (EMS) which truncates the message vectors and trellis-based EMS (T-EMS) which employs the trellis representation. Our modification of EMS introduces the thresholds to further truncate the incoming messages to the check node. The performance of our improved new algorithm is only 0.05dB (resp 0.2dB) to BP in the waterfall region over GF(8) (resp GF(128)), but the complexity will reduce to lower than half of the EMS when the threshold is chosen reasonable.
ISSN:2472-7628
DOI:10.1109/WCSP.2016.7752595