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

doi:10.13190/jbupt.201006.129.huangch

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2010, Vol. 33 ›› Issue (6): 129-133.doi: 10.13190/jbupt.201006.129.huangch

• Reports • Previous Articles Next Articles

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

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

References

[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]	WEI Rui-dong, YU Peng, GAO Song, ZHAO Pu-yuan, LI Wen-jing. Multiple Ant Colony Algorithm-Based Routing Method in the Power Communication Network [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2017, 40(s1): 89-92.
[2]	LU You-jun, XU Dao-yun, ZHOU Jin-cheng. Vertex Degree Distribution in Growth Models with Nonlinear Preferential Attachment Rule [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2016, 39(5): 116-123.
[3]	LEI Wei-jia, GUO Xu-jing, WANG Huan-huan, XIE Xian-zhong. A Multi-Relay Transmission Scheme Using Fountain Codes and Adaptive Modulation [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2014, 37(2): 68-73.
[4]	ZHANG Wen-zhe. Analysis and Optimization for Hard-Decoding Performance of Short-Length Fountain Codes [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2013, 36(6): 79-83.
[5]	. Degree Distribution Design of LT Codes Using PSO Algorithm with Gradient [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(3): 40-43.
[6]	HUANG Cheng, YI Ben-shun, GAN Liang-cai, XIE Wen-hua,DENG Zai-hui. Fountain Codes Based on Modulo and Chaos [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2010, 33(3): 121-125.
[7]	XU Cheng-xin;CHANG Yong-yu;YANG Hong-wen;ZHANG Xin. QAM Scheme Using Degree Distribution of LDPC Codes [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2010, 33(1): 89-92.
[8]	ZHANG Yu-jie;MENG Xiang-wu. Initial Credit Scoring for Telecom Customers Using Ant Colony Algorithm [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2010, 33(1): 124-128.
[9]	. Research on Grid Resource Scheduling Based onImproved Ant Colony Algorithm [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2009, 32(s1): 111-114.
[10]	HUANG Cheng YI Ben-Shun. Implementation of Fountain Codes based on Logistic map [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2009, 32(1): 103-107.
[11]	MA Jun, ZHANG Jian-pei, YANG Jing, CHENG Li-li. Improved Ant Colony Algorithm to Solve Traveling [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(6): 46-49.
[12]	WANG Hai-xing, SHEN Jin-sheng . Intelligent Ant Colony Algorithm for Transit Scheduling Problem [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2006, 29(s2): 30-34.

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

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 12

Recommended Articles

Metrics

Comments