首页 | 本学科首页   官方微博 | 高级检索  
     检索      

构造消环的LDPC码
引用本文:闻斌,姜伟,张立,欧卫华.构造消环的LDPC码[J].常熟理工学院学报,2011,25(2):32-34.
作者姓名:闻斌  姜伟  张立  欧卫华
作者单位:常熟理工学院数学与统计学院;湖南怀化学院数学系;
基金项目:湖南省教育厅科研资助项目(07C507)
摘    要:LDPC(Lower Density Parity Check)码是一类可以用非常稀疏的校验矩阵定义的线性分组纠错码.由于LDPC码校验矩阵的规律性可以用二分图表现出来,二分图中的环路也会影响到迭代译码的准确性和有效性,尤其是短环.本文给出了一种有效消去周长为4的短环的校验矩阵H的生成算法,并且对该算法构造的校验矩阵进行了仿真分析.

关 键 词:LDPC码  二分图  周长

Construction of Cycle-free LDPC Codes
WEN Bin,JIANG Wei,ZHANG Li,OU Wei-hua.Construction of Cycle-free LDPC Codes[J].Journal of Changshu Institute of Technology,2011,25(2):32-34.
Authors:WEN Bin  JIANG Wei  ZHANG Li  OU Wei-hua
Institution:WEN Bin1,JIANG Wei1,ZHANG Li1,OU Wei-hua2(1.School of Mathematics and Statistics,Changshu Institute of Technology,Changshu 215500,China,2.Department of Mathematics,Huaihua University,Huaihua 418008,China)
Abstract:The linear block code is called a binary Low Density Parity Check code if its parity-check matrix is a sparse matrix.For the features of parity-check matrix,a LDPC code can be illustrated by a Tanner graph.Cycles,especially short cycles in the Tanner graph,which lead to inefficient decoding and prevent the decoding algorithm from converging to the optimal decoding result.In this paper,we demonstrate that a detection method of short cycle presents generation algorithm of check matrix without cycle 4 and simu...
Keywords:LDPC code  Bipartite graph  girth  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号