短码长LT码的蚁群算法度分布优化

doi:10.13190/jbupt.201006.129.huangch

北京邮电大学学报 ›› 2010, Vol. 33 ›› Issue (6): 129-133.doi: 10.13190/jbupt.201006.129.huangch

短码长LT码的蚁群算法度分布优化

黄诚^1,2,易本顺¹,吴雄斌¹,甘良才¹,邓在辉¹

1.武汉大学电子信息学院, 武汉 430079; 2.中国电信股份有限公司武汉分公司, 武汉 430071

收稿日期:2009-01-06 修回日期:2010-07-03 出版日期:2010-12-28 发布日期:2011-01-07
通讯作者: 黄诚 E-mail:wtvoid@163.com
基金资助:
国家自然科学基金项目（61072041）

The Degree Distribution Optimization of Short Code  Length LT Codes Using Ant Colony Algorithm

Received:2009-01-06 Revised:2010-07-03 Online:2010-12-28 Published:2011-01-07

摘要/Abstract

摘要：

度分布是Luby transform(LT)码性能优劣的关键指标，为得到更优的度分布结构，提出一种基于蚁群算法的LT码度分布优化方法.将蚁群算法与蒙特卡洛仿真结合，以仿真结果的特定统计参数作为优化目标值，通过蚁群算法的搜索，得到优化的度分布值.通过仿真实验对比测试优化后度分布的实际译码性能，证实了该方法能得到满足以蒙特卡洛仿真统计参数为优化目标的度分布.

关键词: 喷泉码, Luby transform码, 度分布, 蚁群算法

Abstract:

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.

Key words: fountain codes, Luby transform codes, degree distribution, ant colony algorithm

黄诚,易本顺,吴雄斌,甘良才,邓在辉. 短码长LT码的蚁群算法度分布优化[J]. 北京邮电大学学报, 2010, 33(6): 129-133.

参考文献

[1] Luby M. LT codes//FOCS 2002. Vancouver: IEEE Press, 2002: 271-282.
[2] Shokrollah A. Raptor codes[J]. IEEE Trans on Info Theory, 2006, 52(6): 2551-2567.
[3] Makay D J. Fountain codes[J]. Proceedings of IEEE Communications, 2005, 152(6): 1062-1068.
[4] Venkiah A, Piantanida P, Poullia C, et al. Rateless coding for quasi-static fading channels using channel estimation accuracy //ISIT 2008. Toronto: IEEE Press, 2008: 2257-2261.
[5] Agarwal S, Hagedorn A, Trachtenberg A. Adaptive rateless coding under partial information//ITA 2008. San Diego: IEEE Press, 2008: 5-11.
[6] Xiao Ming, Aulin T, Medard M. Systematic binary deterministic rateless codes// ISIT 2008. Toronto: IEEE Press, 2008: 2066-2070.
[7] Tarus H, Bush J, Irvine J, et al. Exploiting redundancies to improve performance of LT decoding //CNSR 2008. Halifax: IEEE Press, 2008: 198-202.
[8] 黄诚, 易本顺. 基于抛物线映射的混沌LT编码算法[J].电子与信息学报, 2009, 31(10): 2527-2531. Huang Cheng, Yi Benshun. Chaotic LT encoding algorithm based on parabolic map[J]. Journal of Electronics and Information Technology, 2009, 31(10): 2527-2531.
[9] 黄诚, 易本顺. 喷泉码的Logistic映射实现[J]. 北京邮电大学学报, 2009, 32(1): 103-107. Huang Cheng, Yi Benshun. Implementation of fountain codes using Logistic map[J]. Journal of Beijing University of Posts and Telecommunications, 2009, 32(1): 103-107. (上接第128页)
[4] Ilhan H, Altunba I S, Uysal M. Cooperative diversity for relay-assisted inter-vehicular communication//VTC-Spring’08. Singapore: IEEE Press, 2008: 605-609.
[5] Gradshteyn I S, Ryzhik I M. Table of integrals, series and products[M]. 7th ed. San Diego: Academic Press, 2007.
[6] Hasna M O, Alouini M S. End-to-end performance of transmission systems with relays over Rayleigh fading channels[J]. IEEE Trans Wireless Commun, 2003, 2(16): 1126-1131.
[7] Uysal M. Maximum achievable diversity order for cascaded Rayleigh fading channels[J]. Electron Lett, 2005, 41(23): 1289-1290.
[8] Simon M K, Alouini M S. Digital communication over fading channels[M]. 2nd ed. Hoboken: John Wiley & Sons Press, 2005.
[9] Yilmaz F, Kucur O. Exact performance of wireless multihop transmission for M-ary coherent modulations over generalized gamma fading channels//PIMRC’08. Cannes: IEEE Press, 2008: 1-5.

[1]	彭维平王戈宋成阎俊豪. 面向高移动性车联网场景的预测卸载决策算法[J]. 北京邮电大学学报, 2023, 46(2): 43-49.
[2]	余修武, 刘琴, 李向阳, 张可, 肖人榕. 基于改进蚁群的BP神经网络WSN数据融合算法[J]. 北京邮电大学学报, 2018, 41(4): 91-96.
[3]	卫瑞东, 喻鹏, 高嵩, 赵浦媛, 李文璟. 基于多蚁群算法的电力通信网路由配置机制[J]. 北京邮电大学学报, 2017, 40(s1): 89-92.
[4]	冯霞, 郝慧敏. GA-ACO算法用于IMX系统测试数据自动生成[J]. 北京邮电大学学报, 2016, 39(5): 99-103.
[5]	卢友军, 许道云, 周锦程. 带非线性优先连接规则增长模型的节点度分布[J]. 北京邮电大学学报, 2016, 39(5): 116-123.
[6]	雷维嘉, 郭旭静, 王换换, 谢显中. 采用喷泉码和自适应调制的多中继传输机制[J]. 北京邮电大学学报, 2014, 37(2): 68-73.
[7]	张文哲. 短喷泉码硬译码性能的分析与优化[J]. 北京邮电大学学报, 2013, 36(6): 79-83.
[8]	邓在辉，易本顺，甘良才，肖进胜，黄诚. 采用带梯度的粒子群优化算法的LT码度分布设计[J]. 北京邮电大学学报, 2011, 34(3): 40-43.
[9]	黄诚易本顺甘良才解文华邓在辉. 采用模运算和混沌的喷泉码[J]. 北京邮电大学学报, 2010, 33(3): 121-125.
[10]	许成鑫;常永宇;杨鸿文;张欣. 利用LDPC码度分布的QAM方案[J]. 北京邮电大学学报, 2010, 33(1): 89-92.
[11]	张玉洁;孟祥武. 利用蚁群算法求解电信客户初始信用评分问题[J]. 北京邮电大学学报, 2010, 33(1): 124-128.
[12]	黄文明;兰静;张阳. 基于改进蚁群算法的网格资源调度[J]. 北京邮电大学学报, 2009, 32(s1): 111-114.
[13]	黄诚易本顺. 喷泉码的Logistic映射实现[J]. 北京邮电大学学报, 2009, 32(1): 103-107.
[14]	马骏, 张健沛, 杨静，程丽丽. 改进型蚁群算法求解旅行Agent问题[J]. 北京邮电大学学报, 2008, 31(6): 46-49.
[15]	王海星申金升. 智能蚁群算法解决公交区域调度问题研究[J]. 北京邮电大学学报, 2006, 29(s2): 30-34.

短码长LT码的蚁群算法度分布优化

The Degree Distribution Optimization of Short Code  Length LT Codes Using Ant Colony Algorithm

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价