期刊文献+

基于抛物线映射的混沌LT编码算法 被引量:11

Chaotic LT Encoding Algorithm Based on Parabolic Map
下载PDF
导出
摘要 该文提出一种基于抛物线映射和混沌置乱方法的LT编码算法。首先用混沌初始值作为密钥,采用抛物线映射产生混沌序列并转换为类均匀分布序列,再通过位置置乱算法生成LT码的度分布和度邻接数据序列,较传统的重要抽样方法具有更高的灵敏度,保留了理论分布的结构。实验结果表明,该算法具有实现结构简单、分组头部开销小、保密性好及高于传统重要抽样方法的性能。 A Luby Transform (LT) encoding algorithm based on parabolic map by using chaotic scrambling method is proposed. Firstly, chaotic sequences are produced by using parabolic map and then transformed into uniform-like sequences. The degree distribution and data set of neighbors of LT codes are generated by using position scrambling algorithm which is more sensitive than traditional importance sampling method keeping the construction of theoretical distribution. Experimental results show that the algorithm has more simple construction, smaller header costs of the packets, better encryption effect and hlrthermore is outperformed the traditional importance sampling method.
作者 黄诚 易本顺
出处 《电子与信息学报》 EI CSCD 北大核心 2009年第10期2527-2531,共5页 Journal of Electronics & Information Technology
关键词 混沌 抛物线映射 混沌置乱 无码率码 LT码 Chaos Parabolic map Chaotic scrambling Rateless codes Luby Transform(LT) codes
  • 相关文献

参考文献11

  • 1Luby M. LT codes[C]. Proceedings of The 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, CA, 2002: 271-282.
  • 2Makay D J. Fountain codes[J]. Proceedings of IEEE, Communications, 2005, 152(6): 1062-1068.
  • 3林广荣,林新荣,依那,金野,梁庆林.基于LDPC码的数字喷泉编码[J].电子与信息学报,2008,30(4):822-825. 被引量:4
  • 4肖东亮,焦秉立,林春蕾,陆建华.混沌理论在现代信道编码技术中的应用[J].电子学报,2007,35(10):1961-1967. 被引量:10
  • 5Park Dohyung and Chung Sae-Young. Performance- complexity tradeoffs of rateless codes [C]. 2008 IEEE International Symposium on Information Theory, Toronto, CA, 2008, 7: 2056-2060.
  • 6Venkiah A, Piantanida P, and Poullia C, et al.. Rateless coding for quasi-static fading channels using channel estimation accuracy [C]. 2008 IEEE International Symposium on Information Theory, Toronto, CA, 2008, 7: 2257-2261.
  • 7Agarwal S, Hagedorn A, and Trachtenberg A. Adaptive rateless coding under partial information[C]. Information Theory and Applications Workshop, San Diego, USA , 2008, 2: 5-11.
  • 8Ming Xiao, Aulin T, and Medard M. Systematic binary deterministic rateless codes[C]. 2008 IEEE International Symposium on Information Theory, Toronto, CA, 2008, 7: 2066-2070.
  • 9Tarus H, Bush J, Irvine J, and Dunlop J. Exploiting Redundancies to Improve Performance of LT Decoding [C]. Communication Networks and Services Research Conference 2008 6th Annual, Halifax, CA, 2008, 5: 198-202.
  • 10蔡国权,宋国文,于大鹏.Logistic映射混沌扩频序列的性能分析[J].通信学报,2000,21(1):60-63. 被引量:34

二级参考文献27

  • 1王亥,胡健栋.改进型Logistic-Map混沌扩频序列[J].通信学报,1997,18(8):71-77. 被引量:78
  • 2郝柏林,从抛物线谈起.混沌动力学引论,1995年
  • 3梁泰基,统计无线电理论,1988年
  • 4C Berrou, A Glavieux, P Thitimajshima. Near Shannon Limit Error Correcting Coding and Decoding:Turbo Codes[A] .Proc of Int Conf on Comm. ' 93 [C]. Geneva Switzerland: IEEE Press, 1993. 1064 - 1070.
  • 5R G Gallager. Low Density Parity Check Codes [M]. Cambridge, Massachusetts:MIT Press, 1963.53 - 73.
  • 6D J C MacKay, R M Neal. Good error correcting codes based on very sparse matrices [J]. IEEE Trans on Inform Theory, 1999,45(3) :399 - 431.
  • 7Seho Myung, Kyeongcheol Yang, Jaeyoel Kim, Quasi-cyclic LDPC codes for fast encoding[J]. IEEE Trans on Inform Theory,2005,51 (8) :2894- 2901.
  • 8R C Robinson. An Introduction to Dynamical Systems: Continuous and Discrete[M]. Pearson Education Asia Limited and China Machine Press, 2005. 245 - 279.
  • 9M Henon. A two-dimensional mapping with a strange attractor [J]. Commun Math Plays, 1976,50(1) :69 - 77.
  • 10Libero Dinoi, Sergio Benedetto. Design of fast-prunable S-random interleavers[J]. IEEE Trans on Wireless Communications. 2005,4(5) :2540 - 2548.

共引文献45

同被引文献98

  • 1达瓦.调和级数及其发散性的多种证法[J].阴山学刊(自然科学版),2009,23(2):80-82. 被引量:1
  • 2Luby M, Watson M, Gasiba T, et al. Mobile data broadcasting over MBMS tradeoffs in forward error correction [J]. ACM International Conference Proceeding Series, 2006, 193(10) : 10-20.
  • 3Luby M, Watson M, Gasiba T, et al. Raptor codes for reliable download delivery in wireless broadcast systems [C]//CCNC 2006. Las Vegas: [s. n.], 2006: 192- 197.
  • 4Tee 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 ]// VCT 2006-Spring. Melbourne: [ s. n. ], 2006 : 22-26.
  • 5Casari P, Rossi M, Zorzi M. Towards optimal broadcasting policies for HARQ based on fountain codes in underwater networks [C]//WONS 2008. Garmisch Partenkirchen: [s.n. ], 2008: 11-19.
  • 6Luby M. LT codes[C]//Proc of the 43th Annual IEEE Symposium on FOCS. Vancouver: [ s. n. ] , 2002: 271- 280.
  • 7Shokrollahi A. Raptor codes [ J ]. IEEE Trans on Inform Theory, 2006, 52(6) : 2551-2567.
  • 8Chang C C, Lee J S. Robust t-out-of-n oblivious transfer mechanism based on CRT [ J ]. Journal of Network and Computer Applications, 2009, 32(1 )-: 226-235.
  • 9Chang C C, Lai Y P. A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli [ J ]. Applied Mathematics and Computation, 2005, 161(1) : 181-194.
  • 10Zheng Xinliang, Huang C T, Matthews M. Chinese remainder theorem based group key management [ C ] // Winston-Salem: [s. n. ], 2007: 266-271.

引证文献11

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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