A modified normalized min‐sum algorithm for LDPC decoding using order statistics

Summary In this paper, we propose a new modified normalized min‐sum algorithm for low‐density parity‐check decoding. Instead of normalizing the results of the check node renew calculations by a single modification factor, we use two different modification factors to normalize the results of check no...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of satellite communications and networking Jg. 35; H. 2; S. 163 - 175
Hauptverfasser: Xue, Wen, Ban, Tian, Wang, Jianxin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Chichester Wiley Subscription Services, Inc 01.03.2017
Schlagworte:
ISSN:1542-0973, 1542-0981
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Summary In this paper, we propose a new modified normalized min‐sum algorithm for low‐density parity‐check decoding. Instead of normalizing the results of the check node renew calculations by a single modification factor, we use two different modification factors to normalize the results of check node renew calculations. One modification factor for the position of the first minimum value and another modification factor for other positions. We obtain two modification factors by theoretical analysis using the theory of order statistics. Simulation results show that the new modified normalized min‐sun algorithm achieves better bit error rate performance than normalized min‐sun algorithm without adding implementation complexity. Copyright © 2016 John Wiley & Sons, Ltd. We propose a new modified normalized min‐sum algorithm (NMSA) for low‐density parity‐check codes decoding. Two different modification factors are used to normalize the results of check node renew calculations. Simulation results show that the new modified NMSA achieves better bit error rate performance than NMSA without adding implementation complexity.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1542-0973
1542-0981
DOI:10.1002/sat.1173