Full metadata record
DC FieldValueLanguage
dc.contributor.authorChang, Chi-Yuanen_US
dc.contributor.authorChen, Yu-Liangen_US
dc.contributor.authorLee, Chang-Mingen_US
dc.contributor.authorSu, Yu T.en_US
dc.date.accessioned2014-12-08T15:21:24Z-
dc.date.available2014-12-08T15:21:24Z-
dc.date.issued2009en_US
dc.identifier.isbn978-1-4244-4312-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/15225-
dc.identifier.urihttp://dx.doi.org/10.1109/ISIT.2009.5205781en_US
dc.description.abstractImplementing 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.en_US
dc.language.isoen_USen_US
dc.titleNew Group Shuffled BP Decoding Algorithms for LDPC Codesen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/ISIT.2009.5205781en_US
dc.identifier.journal2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4en_US
dc.citation.spage1664en_US
dc.citation.epage1668en_US
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000280141401045-
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000280141401045.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.