Informed shuffled belief‐propagation decoding for low‐density parity‐check codes. Issue 18 (1st December 2015)

• Record Type: Journal Article
• Authors: Gong, Yi; Liu, Xingcheng; Han, Guojun; Wu, Bin
• Is Part Of: IET communications. Volume 9:Issue 18(2015)
• Page Start: 2259
• Page End: 2266
• Publication Date: 2015-12-01
• Subjects: belief networks -- parity check codes -- telecommunication scheduling -- maximum likelihood decoding -- convergence; informed shuffled belief propagation decoding -- low‐density parity check code -- sequential belief propagation -- BP decoding -- flooding BP -- informed dynamic scheduling BP algorithm -- informed dynamic location method -- variable node log likelihood ratio value -- reorder variable node -- SBP algorithm convergene -- signal‐to‐noise ratio; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2014.1169
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract : 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.