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

短码长LT码的蚁群算法度分布优化 被引量：4

The Degree Distribution Optimization of Short Code Length LT Codes Using Ant Colony Algorithm
原文传递
导出
摘要 度分布是Luby transform(LT)码性能优劣的关键指标,为得到更优的度分布结构,提出一种基于蚁群算法的LT码度分布优化方法.将蚁群算法与蒙特卡洛仿真结合,以仿真结果的特定统计参数作为优化目标值,通过蚁群算法的搜索,得到优化的度分布值.通过仿真实验对比测试优化后度分布的实际译码性能,证实了该方法能得到满足以蒙特卡洛仿真统计参数为优化目标的度分布. The degree distribution is key index to evaluate the performance of Luby transform （LT） codes. In order to obtain a better degree distribution, a degree distribution optimization method is proposed. By using ant colony algorithm and Monte Carlo simulations, some statistical parameters are selected as optimization target values. By searches of ant colony algorithm, optimized degree distribution could be derived. Compared with the actual decoding performance of optimized degree distribution according to simulations, the effectiveness is confirmed that can achieve the optimization target values by statistical parameters from Monte Carlo simulations.
作者 黄诚 易本顺 吴雄斌 甘良才 邓在辉
机构地区 武汉大学电子信息学院 中国电信股份有限公司武汉分公司
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2010年第6期129-133,共5页 Journal of Beijing University of Posts and Telecommunications
基金 国家自然科学基金项目(61072041)
关键词 喷泉码 Luby transform码 度分布 蚁群算法 fountain codes Luby transform codes degree distribution ant colony algorithm
分类号 TN911.2 [电子电信—通信与信息系统]
  • 相关文献

参考文献9

  • 1Luby M.LT codes[C] //FOCS 2002.Vancouver:IEEE Press,2002:271-282.
  • 2Shokrollah A.Raptor codes[J].IEEE Trans on Info Theory,2006,52(6):2551-2567.
  • 3Makay D J.Fountain codes[J].Proceedings of IEEE Communications,2005,152(6):1062-1068.
  • 4Venkiah A,Piantanida P,Poullia C,et al.Rateless coding for quasi-static fading channels using channel estimation accuracy[C] //ISIT 2008.Toronto:IEEE Press,2008:2257-2261.
  • 5Agarwal S,Hagedorn A,Trachtenberg A.Adaptive rateless coding under partial information[C] //ITA 2008.San Diego:IEEE Press,2008:5-11.
  • 6Xiao Ming,Aulin T,Medard M.Systematic binary deterministic rateless codes[C] // ISIT 2008.Toronto:IEEE Press,2008:2066-2070.
  • 7Tarus H,Bush J,Irvine J,et al.Exploiting redundancies to improve performance of LT decoding[C] //CNSR 2008.Halifax:IEEE Press,2008:198-202.
  • 8黄诚,易本顺.基于抛物线映射的混沌LT编码算法[J].电子与信息学报,2009,31(10):2527-2531. 被引量：11
  • 9黄诚,易本顺.喷泉码的Logistic映射实现[J].北京邮电大学学报,2009,32(1):103-107. 被引量：11

二级参考文献20

  • 1Castura J, Mao Yongyi. Rateless coding over fading channels[J]. IEEE Communication Letters, 2006, 10 (1) : 46-48.
  • 2Ma Yuanyuan, Yuan Dongfeng, Zhang Haixia. Fountain codes and applications to reliable wireless broadcast system [ C] // Proceedings of IEEE Information Theory Workshop. Chengdu: IEEE Press, 2006: 66-70.
  • 3Tee R Y S, Nguyen T D, Yang Lieliang, et al. Serially concatenated luby transform coding and bit-interleaved coded modulation using iteratlive decoding for the wireless internet [ C ] //Vehicular Technology Conference, VTC 2006-Spring. IEEE 63^rd. Melbourne: IEEE Press, 2006 : 22-26.
  • 4Venkiah A, Piantanida P, Poullia C, et al. Rateless coding for quasi-static fading channels using channel estimation accuracy [ C ]//IEEE International Symposium on Information Theory. Toronto: IEEE Press, 2008:2257- 2261.
  • 5Luby M. LT codes[C]//Proceedings of The 43^rd Annual IEEE Symposium on Foundations of Computer Science. Vancouver; IEEE Press, 2002. 271-282.
  • 6Shokrollah M A. Raptor codes[J]. IEEE Transactions on Information Theory, 2006, 52(6) : 2551-2567.
  • 7Makay D J. Fountain codes [J]. Proceedings of IEEE Communications, 2005, 152(6): 1062-1068.
  • 8Palanki P, Yedidia J S. Rateless codes on noisy channels [C] // IEEE International Symposium on Information Theory. Chicago: IEEE Press, 2004: 1-12.
  • 9Luby M. LT codes[C]. Proceedings of The 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, CA, 2002: 271-282.
  • 10Makay D J. Fountain codes[J]. Proceedings of IEEE, Communications, 2005, 152(6): 1062-1068.

共引文献15

同被引文献22

  • 1M. Luby. LT Codes[C]. Proceedings of The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002:271-282.
  • 2A. Shokrollah. Raptor Codes[J]. IEEE Transactions on Information Theory, 2006, 52:2551-2567.
  • 3D. J. Makay. Fountain Codes[C]. Proceedings of IEEE, Communications, 2005, 152: 1062-1068.
  • 4P. Palanki, J. S. Yedidia. Rateless codes on Noisy Channels[C]. IEEE International Symposium on Information Theory, 2004, 8:1-12.
  • 5LUBY M.LT Codes[M].USA:ACM,2002:6-7.
  • 6SHOKROLLAHI A.Raptor Codes[J].IEEE Transactions on Information Theory,2006,52(06):2551-2555.
  • 7FINAMORE,WEILER A,RAMOS,et al.Improving the Performance of LT Codes[C].USA:IEEE,2010:566-570.
  • 8ZHANG Fan,XU Lixin,PAN Xi.Comparison of BP and Gauss Code base on Fountain Code Measuring[C].USA:ICMTMA,2011:737-740.
  • 9ZHU Hongjie,ZHANG Chao,LU Jianhua.Designing of Fountain Codes with Short Code-Length[C].USA:IWSDA,2007:65-68.
  • 10冀保峰,高宏峰.Fountain码编译码技术的研究[J].通信技术,2008,41(11):66-68. 被引量：2

引证文献4

二级引证文献11

北京邮电大学学报
2010年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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