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

非规则全分集LDPC码的构造方法

Construction method for irregular full diversity LDPC codes
下载PDF
导出
摘要 提出一种基于渐进边增长(Progressive Edge-Growth,PEG)算法的非规则全分集低密度奇偶校验(Low-Density Parity-Check,LDPC)码的构造方法。首先根据度分布和码率,对非规则全分集LDPC码中的节点进行度分配;然后对PEG算法中校验节点的选择标准加以约束,生成消除短环的非规则全分集LDPC码;进一步,通过改变局部校验节点剩余度的方法,解决在特殊度分布下算法失效的问题。仿真结果表明,构造的非规则全分集LDPC码在瑞利块衰落信道下能够实现全分集;在码长、码率相同的情况下与规则全分集LDPC码相比,非规则全分集LDPC码能够获得更高的编码增益。 A progressive edge-growth （PEG） based algorithm is proposed to construct irregular Iulldiversity low-diversity parity-check （LDPC） codes. First, according to degree distribution polynomialsand the code rate, all nodes are allocated with different degrees. Second, the criteria of selecting checknodes in the PEG algorithm is performed in a restricted way without containing short eyeles. In addition,the failures of PEG algorithm in some special cases are conquered by modifying the residual degree ofsome check nodes, the simulation results show that the irregular full diversity LDPC codes constructedwith the proposed algorithm can obtain full diversity over block fading channel. Meanwhile, the irregularLDPC codes are shown to outperform the regular ones with the same code length and code rate.
作者 黄静 陈为刚
机构地区 天津大学电子信息工程学院
出处 《信息技术》 2014年第8期14-17,共4页 Information Technology
基金 国家自然科学基金项目(61101114) 教育部新世纪优秀人才支持计划(NCET-12-0401) 天津市自然科学基金(11JCYBJC00400) 国家教育部回国人员科研启动基金(2011D4-0010) 天津市科技兴海项目(KJXH2011-2)
关键词 全分集LDPC码 PEG算法 非规则码 full diversity LDPC codes PEG algorithm irregular codes
分类号 TN911.22 [电子电信—通信与信息系统]
  • 相关文献

参考文献10

  • 1Boutros J J, Guill~n i Fabregas A, Bigliefi E, et al. Low-density parity-check codes for nonergodic block-fading channels [ J ]. IEEE Transactions on Information Theory, 2010, 56 (9) :4286 - 4300.
  • 2Boutros J J. Diversity and coding gain evolution in graph codes [ M]. Proceedings of 2009 Information Theory and Applications Workshop, San Diego, USA, IEEE Press, 2009:34 -43.
  • 3Uehoa A, Healy C, De Lamare R C, et al. LDPC codes based on progressive edge growth techniques for block fading channels[ M ]. Proceedings of 2011 8th International Symposium on Wireless Com- munication Systems (ISWCS), Aachen, Germany, IEEE Press, 2011:392 -396.
  • 4Li Y, Salehi M. Quasi-cyclic LDPC code design for block-fading channels[ C]. Proceedings of the 44th IEEE Annum Conference on Information Sciences and Systems, Princeton, USA, IEEE Press, 2010:1 -5.
  • 5Uehoa A, Healy C, De Lamare, et al. Generalised quasi-cyclic LD- PC codes based on progressive edge growth techniques for block fa- ding channels [ M ]. Proceedings of 2012 International Symposium on Wireless Communication Systems (ISWCS), Paris, France, IEEE Press, 2012:974-978.
  • 6Hu X-Y, Eleftheriou E, Arnold D M. Regular and irregular progres- sive edge-growth tanner graphs[ J ]. IEEE Transactions on Informa- tion Theory. 2005, 51 ( 1 ) :386 -398.
  • 7郭锐,胡方宁,刘济林.一种高性能全分集LDPC码的构造方法[J].电子与信息学报,2011,33(12):2935-2941. 被引量：1
  • 8焦晓鹏,慕建君,周利华.一种Tanner图短环计数新方法[J].西安电子科技大学学报,2010,37(2):311-314. 被引量：7
  • 9Li Z, Vijaya Kumar B V K. A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph [ M ]. Proceedings of the 38th IEEE Asilomar Conference on Signals, Sys- tems and Computers, Pacific Grove, USA, IEEE Press, 2004:1990 - 1994.
  • 10David Mackay. Encyclopedia of Sparse Graph codes [ EB/OL ]. http ://www. inference, phy. cam. ac. uk/ MacKay/codes/data. ht- mlJHJs8.

二级参考文献22

  • 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.
  • 4Tanner R M.A Recursive Approach to Low Complexity Codes[J].IEEE Trans on Information Theory,1981,27(5):533-547.
  • 5Halford 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.
  • 6Fan 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.
  • 7Mao 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.
  • 8Wu 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.
  • 9MacKay D J C.Encyclopedia of Sparse Graph Codes[DB/OL].[2008-09-04].http://www.inference.phy.cam.ac.uk./mackay/codes/data.html.
  • 10Boutros J J, Fabregas A G, Biglieri E, et al.. Design and analysis of low-density parity-check codes on block-fading channels. IEEE Information Theory and Applications Workshop, San Diego, USA, Feb. 2007: 211-215.

共引文献6

信息技术
2014年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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