期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种Tanner图短环计数新方法 被引量：7

Novel method for counting short cycles of Tanner graphs
下载PDF
导出
摘要 短环是影响低密度校验码迭代译码性能的重要因素.利用树结构展开的思想,通过分析无效短环和重复短环对计数结果的影响,得出了低密度校验码的一个短环计数公式.利用这一公式,提出了一种基于树结构展开的Tanner图短环计数算法,可对任意给定长度的短环进行计数,从而克服了现有短环计数算法仅能对特定长度短环计数的缺点.对一些典型低密度校验码的短环数量统计结果表明这种算法的正确性. Short cycles have an important influence on iterative decoding for low-density parity-check（LDPC） codes.By using tree expanding of Tanner graphs and the analysis of the influence of invalid cycles and duplicate cycles,a formula for counting short cycles of LDPC codes is derived.With the derived formula,an algorithm for counting short cycles of Tanner graphs based on tree expanding is proposed.The proposed algorithm can count short cycles with arbitrary lengths,and thus overcomes the disadvantage of existing algorithms that count short cycles with given lengths.Numerical results of counting short cycles of some typical LDPC codes show the correctness of the proposed algorithm.
作者 焦晓鹏 慕建君 周利华
机构地区 西安电子科技大学计算机学院 西安电子科技大学综合业务网理论及关键技术国家重点实验室
出处 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2010年第2期311-314,共4页 Journal of Xidian University
基金 综合业务网理论及关键技术国家重点实验室开放基金资助项目(ISN10-04) 国家自然科学基金资助项目(60573034)
关键词 低密度校验码 TANNER图 短环 树结构展开 low-density parity-check（LDPC） codes Tanner graph short cycles tree expanding
分类号 TN911.22 [电子电信—通信与信息系统]
  • 相关文献

参考文献11

  • 1Gallager R G.Low-density Parity-check Codes[J].IRE Trans Information Theory,1962,8(1):21-28.
  • 2MacKay D J C,Neal R M.Near Shannon Limit Performance of Low Density Parity Check Codes[J].Electronics Letters,1997,32(18):1645-1646.
  • 3Richardson T J,Shokrollahi M A,Urbanke R.Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes[J].IEEE Trans on Information Theory,2001,47(2):619-637.
  • 4孙韶辉,慕建君,王新梅.低密度校验码研究及其新进展[J].西安电子科技大学学报,2001,28(3):393-397. 被引量：23
  • 5Tanner R M.A Recursive Approach to Low Complexity Codes[J].IEEE Trans on Information Theory,1981,27(5):533-547.
  • 6Halford T R,Chugg K M.An Algorithm for Counting Short Cycles in Bipartite Graphs[J].IEEE Trans on Information Theory,2006,52(1):287-292.
  • 7陈汝伟,黄华伟,杜小妮,丁勇,肖国镇.Tanner图中最短圈的计数[J].西安电子科技大学学报,2008,35(6):983-985. 被引量：2
  • 8Fan J,Xiao Y.A Method of Counting the Number of Cycles in LDPC Codes[C]//The 8~(th) International Conference on Signal Processing(ICSP).Guilin:IEEE,2006:16-20.
  • 9Mao Y.Banihashemi A H.A Heurist Search for Good Low Density Parity-check Codes At Shon Block Lengths[C]//Proc Int Conf Communications.Helsinki:IEEE,2001:41-44.
  • 10Wu Xiaofu,Zhao Chunming,You Xiaohu,et al.Clustering of Cycles and Construction of LDPC Codes[C]//Proc IEEE GLOBECOM.New Orleans:IEEE,2008:1102-1105.

二级参考文献14

  • 1童胜,王鹏,王单,王新梅.LDPC码量化和积译码的高效实现[J].西安电子科技大学学报,2004,31(5):709-713. 被引量：13
  • 2王鹏,王新梅.LDPC码的快速编码研究[J].西安电子科技大学学报,2004,31(6):934-938. 被引量：20
  • 3Gallager R G. Low Density Parity Check Codes [J]. IRE Trans on Inform Theory, 1962, IT-8: 21-28.
  • 4Tanner R M. A Recursive Approach to Low Complexity Codes[J]. IEEE Trans on Inf Theory, 1981, 27(5) : 533 547.
  • 5MacKay D J C, Neal R M. Near Shannon Limit Performance of Low Density Parity Check Codes[J]. IEE Electron Lett, 1996, 32(18): 1645-1646.
  • 6Lin S, Costello D J. Error Control Coding: Fundamentals and Applications [M]. 2nd Edition. Upper Saddle River.. Prentice Hall, 2004.
  • 7Mao Y, Banihashemi A H. A Heuristic Search for Good Low Density Parity-check Codes at Short Block Lengths[C]// Proc Int Conf Communications.. Vol 1. Finland: Helsinki, 2001: 41-44.
  • 8Benedetto S, Montorsi G. Design of Parallel Concatenated Convolutional Codes[J]. IEEE Trans on Commun, 1996, 44 (5) : 591-600.
  • 9Halford T R, Chugg K M. An Algorithm for Counting Short Cycles in Bipartite Graphs[J]. IEEE Trans on Inf Theory, 2006, 52(1): 287-292.
  • 10Chen R, Huang H, Xiao G. Relation Between Parity-Check Matrixes and Cycles of Associated Tanner Graphs [J]. IEEE Communications Letters, 2007, 11 (8) :674-676.

共引文献23

同被引文献69

  • 1张焕明,叶梧,冯穗力.LDPC码的树图法构造[J].电讯技术,2007,47(4):166-168. 被引量：2
  • 2Fossorier M P C.Quasi-Cyclic Low-Density Parity-Check Codes from Circulant Permutation Matrices[J].IEEE Trans on Inform Theory,2004,50(8):1788-1793.
  • 3Wang Y,Yedidia J S,Draper S C.Construction of High-Girth QC-LDPC Codes[C]//5th International Symposium on Turbo Codes and Related Topics.Lausanne:IEEE,2008:180-185.
  • 4Tao Xiongfei,Liu Weizhong,Zou Xuecheng.On the Construction of Low-Density Parity-Check Codes with Girth 10[J].International Journal of Electronics and Communications,2009,63(8):689-694.
  • 5O'Sullivan M E.Algebraic Construction of Sparse Matrices with Large Girth[J].IEEE Trans on Inform Theory,2006,52(2):718-727.
  • 6Hagiwara M,Nuida K,Kitagawa T,et al.On Minimal Length of Quasi Cyclic LDPC Codes with Girth 6[C]//Proc IEEE ISITA.Seoul:IEEE,2006:103-108.
  • 7Hagiwara M,Fossorier M P C,Kitagawa T,et al.Smallest Size of Circulant Matrix for Regular (3,L) and (4,L) Quasi-Cyclic LDPC Codes with Girth 6[J].IEICE Trans on Fundamentals,2009,E92-A(11):2891-2894.
  • 8Colboum C J,Dinitz J H.Handbook of Combinatorial Designs[M].Second Ed.Boca Raton:CRC Press,2006.
  • 9Gallager R G. Low-density Parity-cheek Codes[J].IRE Trans on Information Theory, 1962, 8(1) : 21-28.
  • 10Gallager R G. Low-Density Parity Check Codes [D]. Cambridge: MIT Press, 1963.

引证文献7

二级引证文献12

西安电子科技大学学报
2010年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部