Title: New Group Shuffled BP Decoding Algorithms for LDPC Codes
Authors: Chang, Chi-Yuan
Chen, Yu-Liang
Lee, Chang-Ming
Su, Yu T.
電信工程研究所
Institute of Communications Engineering
Issue Date: 2009
Abstract: Implementing a belief propagation (BP) based LDPC decoder requires high degrees of parallelism using many component soft-in soft-output (SISO) decoding units to perform message passing from variable nodes to check nodes or vice versa. An obvious complexity-reduction solution is to serialize the decoding process, i.e., dividing a decoding iteration into several serial sub-iterations in which a sub-iteration performs only part of the complete parallel message-passing operation. The group horizontal shuffled BP (GHSBP) and vertical shuffled BP (GVSBP) algorithms respectively partition the check and variable nodes of the code graph into groups to perform group-by-group message-passing decoding. This paper proposes new techniques to improve three key elements of a GHSBP decoding algorithm, namely, the grouping method, the decoding schedule and the log-likelihood updating formulae. The (check nodes) grouping method and decoding schedule optimize certain design criterion. The new normalized min-sum updating formula with a self-adjustable correction (scaling) factor offers better nonlinear approximation. Numerical performance of new GHSBP algorithms that include part or all three new techniques indicate that the combination of the proposed grouping and decoding schedule yields a faster convergence rate and our modified min-sum algorithm gives performance superior to that of the conventional min-sum and normalized min-sum algorithm and is very close to that of the sum-product algorithm.
URI: http://hdl.handle.net/11536/15225
http://dx.doi.org/10.1109/ISIT.2009.5205781
ISBN: 978-1-4244-4312-3
DOI: 10.1109/ISIT.2009.5205781
Journal: 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4
Begin Page: 1664
End Page: 1668
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000280141401045.pdf