Multiple candidates bit-flipping algorithms for decoding LDPC codes

This letter proposes an effective scheme to improve the error performance of conventional bit‐flipping (BF) algorithms for decoding low‐density parity‐check codes. The proposed scheme, which is referred to as the multiple‐candidates (MC) scheme, constructs a set of candidates for the starting vector...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Transactions on emerging telecommunications technologies Jg. 26; H. 4; S. 503 - 508
Hauptverfasser:	Huang, Zhiliang, Chen, Ming, Diao, Chunjuan, Chen, Hua-Min
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Blackwell Publishing Ltd 01.04.2015
ISSN:	2161-3915, 2161-3915
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This letter proposes an effective scheme to improve the error performance of conventional bit‐flipping (BF) algorithms for decoding low‐density parity‐check codes. The proposed scheme, which is referred to as the multiple‐candidates (MC) scheme, constructs a set of candidates for the starting vector of the iterative decoding procedure. Each candidate vector in the set is generated by randomly flipping several high error probability bits of the original hard‐decision vector. Simulation results show that two typical BF algorithms applying the MC scheme achieve noticeable gains over the original BF algorithms with moderate increase in computational cost. Copyright © 2012 John Wiley & Sons, Ltd. An effective scheme (multiple‐candidates scheme) is proposed to improve the error performance of conventional bit‐flipping algorithms for decoding low‐density parity‐check codes. Simulation results show that gradient descent bit‐flipping algorithms applying the multiple‐candidates scheme achieve noticeable gains over original algorithms with moderate increase in computational cost.
Bibliographie:	istex:9B4583D61FF5BC2A76328AF18A320C539D5F82B5 ArticleID:ETT2605 ark:/67375/WNG-DPK3G4CG-G
ISSN:	2161-3915 2161-3915
DOI:	10.1002/ett.2605