Open AccessInformed shuffled belief‐propagation decoding for low‐density parity‐check codes
Author(s) -
Gong Yi,
Liu Xingcheng,
Han Guojun,
Wu Bin
Publication year - 2015
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2014.1169
Subject(s) - belief propagation , decoding methods , residual , computer science , algorithm , node (physics) , convergence (economics) , variable (mathematics) , low density parity check code , mathematics , mathematical analysis , structural engineering , engineering , economics , economic growth
Shuffled belief propagation (SBP), as a sequential belief propagation (BP) algorithm, speeds up the convergence of BP decoding, and maintains the least complexity of flooding BP. However, its performance is remarkably inferior to informed dynamic scheduling (IDS) BP algorithms. The authors design an informed dynamic location method, based on the residuals of variable node log‐likelihood ratio values, to reorder variable nodes of SBP to be updated. The location method significantly accelerates the convergence of SBP algorithm from two aspects: the unstable variable node with the largest residual to be updated first, and selecting the largest residual locally. Simulation results show that the proposed algorithm performs nearly the same as the best performance of IDS BP algorithms, and behaves prominently at high signal‐to‐noise ratios.