文章基本信息

标题：Tree Matrix Algorithm of LDPC Codes
本地全文：下载
作者：Huanming Zhang
期刊名称：Journal of Signal and Information Processing
印刷版ISSN：2159-4465
电子版ISSN：2159-4481
出版年度：2014
卷号：05
期号：04
页码：191-197
DOI：10.4236/jsip.2014.54020
语种：English
出版社：Scientific Research Publishing
摘要：LDPC codes are finding increasing use in applications requiring reliable and highly efficient information transfer over bandwidth. An LDPC code is defined by a sparse parity-check matrix and can be described by a bipartite graph called Tanner graph. Loops in Tanner graph prevent the sum-product algorithm from converging. Further, loops, especially short loops, degrade the performance of LDPC decoder, because they affect the independence of the extrinsic information exchanged in the iterative decoding. This paper, by graph theory, deduces cut-node tree graph of LDPC code, and depicts it with matrix. On the basis of tree matrix algorithm, whole depictions of loops can be figured out, providing of foundation for further research of relations between loops and LDPC codes’ performance.
关键词：LDPC; Belief Propagation (BP); Graph; Iterative Decoding; Loop; Cycle