中国物理B ›› 2008, Vol. 17 ›› Issue (10): 3609-3615.doi: 10.1088/1674-1056/17/10/013

• GENERAL • 上一篇    下一篇

Implementation of LT codes based on chaos

周 茜, 李 亮, 陈增强, 赵加祥   

  1. College of Information Technical Science, Nankai University, Tianjin 300071, China
  • 收稿日期:2008-04-02 修回日期:2008-04-14 出版日期:2008-10-20 发布日期:2008-10-20
  • 基金资助:
    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), and the Foundation of the Application Base and Frontier Technology Research Project of Tianjin (Grant Nos 08JCZDJC21900 and 07CYBJC05800).

Implementation of LT codes based on chaos

Zhou Qian(周茜)†, Li Liang(李亮), Chen Zeng-Qiang(陈增强), and Zhao Jia-Xiang(赵加祥)   

  1. College of Information Technical Science, Nankai University, Tianjin 300071, China
  • Received:2008-04-02 Revised:2008-04-14 Online:2008-10-20 Published:2008-10-20
  • Supported by:
    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), and the Foundation of the Application Base and Frontier Technology Research Project of Tianjin (Grant Nos 08JCZDJC21900 and 07CYBJC05800).

PDF (PC)

866

赞

摘要： 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.

Abstract: 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.

Key words: digital fountain, fountain codes, LT codes, Kent chaotic map

中图分类号:  (Communication using chaos)

  • 05.45.Vx
05.45.Pq (Numerical simulations of chaotic systems) 84.40.Ua (Telecommunications: signal transmission and processing; communication satellites)