期刊文献+

Implementation of LT codes based on chaos

Implementation of LT codes based on chaos
下载PDF
导出
摘要 Fountain codes provide an efficient way to transfer information over erasure channels like the Internet. LT codes are the first codes fully realizing the digital fountain concept. They are asymptotically optimal rateless erasure codes with highly efficient encoding and decoding algorithms. In theory, for each encoding symbol of LT codes, its degree is randomly chosen according to a predetermined degree distribution, and its neighbours used to generate that encoding symbol are chosen uniformly at random. Practical implementation of LT codes usually realizes the randomness through pseudo-randomness number generator like linear congruential method. This paper applies the pseudo-randomness of chaotic sequence in the implementation of LT codes. Two Kent chaotic maps are used to determine the degree and neighbour(s) of each encoding symbol. It is shown that the implemented LT codes based on chaos perform better than the LT codes implemented by the traditional pseudo-randomness number generator. Fountain codes provide an efficient way to transfer information over erasure channels like the Internet. LT codes are the first codes fully realizing the digital fountain concept. They are asymptotically optimal rateless erasure codes with highly efficient encoding and decoding algorithms. In theory, for each encoding symbol of LT codes, its degree is randomly chosen according to a predetermined degree distribution, and its neighbours used to generate that encoding symbol are chosen uniformly at random. Practical implementation of LT codes usually realizes the randomness through pseudo-randomness number generator like linear congruential method. This paper applies the pseudo-randomness of chaotic sequence in the implementation of LT codes. Two Kent chaotic maps are used to determine the degree and neighbour(s) of each encoding symbol. It is shown that the implemented LT codes based on chaos perform better than the LT codes implemented by the traditional pseudo-randomness number generator.
出处 《Chinese Physics B》 SCIE EI CAS CSCD 2008年第10期3609-3615,共7页 中国物理B(英文版)
基金 Project supported in part by the National Natural Science Foundation of China (Grant Nos 60774088 and 10772135) the Program for New Century Excellent Talents in University of China (NCET) the Foundation of the Application Base and Frontier Technology Research Project of Tianjin (Grant Nos 08JCZDJC21900 and 07CYBJC05800)
关键词 digital fountain fountain codes LT codes Kent chaotic map digital fountain, fountain codes, LT codes, Kent chaotic map
  • 相关文献

参考文献15

  • 1Byers J W, Luby M, Mitzenmacher M and Rege A 1998 ACM SIGCOMM Comput. Commun. Rev. 28 56.
  • 2Byers J W, Luby M and Mitzenmacher M 2002 IEEE J. Select. Areas Commun. 20 1528.
  • 3Luby M 2002 Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science p271.
  • 4Harrelson C, Lawrence I and Wang W 2003 Proceedings 41st Annual Allerton Conference on Communication, Control, and Computing 41 492.
  • 5Qi G Y, Chen G R, Du S Z, Chen Z Q and Yuan Z Z 2005 Physica A 352 295.
  • 6Qi G Y and Chen G R 2006 Phys. Lett. A 352 386.
  • 7Qi G Y, Du S Z, Chen G R, Chen Z Q and Yuan Z Z 2005 Chaos Solitons Fractals 23 1671.
  • 8Wang F Z, Qi G Y, Chen Z Q and Yuan Z Z 2007 Acta Phys. Sin. 56 3137 (in Chinese).
  • 9Wang F Z, Qi G Y, Chen Z Q, Zhang Y H and Yuan Z Z 2006 Acta Phys. Sin. 55 4005 (in Chinese).
  • 10Zhang Y H, Qi G Y, Liu W L and Yan Y 2006 Acta Phys. Sin. 55 3307 (in Chinese).

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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