期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

采用模运算和混沌的喷泉码 被引量：1

Fountain Codes Based on Modulo and Chaos
原文传递
导出
摘要 为了解决高速无线网络中的传输有效性问题,提出一类新的喷泉码机制及其编译码算法,称为中国变换(CT)码.不同于基于因子图和异或(XOR)运算的现有喷泉码机制,该码的编码算法通过在素数集中均匀选取素数将有限长度的原始分组不断分解为包含余数的编码分组,通过混沌位置置乱算法生成编码分组,接收端只要从这些编码分组中接收固定数量的分组,即能以100%的概率恢复译码.仿真实验验证了新喷泉码的机制及构造的有效性. A new class of fountain codes named Chinese transform（CT） codes is proposed to solve the problem of the efficient transmission in high speed wireless network.Different from existing fountain codes based on Tanner graph and exclusive OR（XOR） operations,the encoding of CT codes transforms finite original symbols into theoretically infinite encoding symbols which are generated by integers selected uniformly from the set of primes which are then enveloped into packets by chaotic position scrambling algorithm.When enough packets are received from these packets,original symbols can be recovered according to the CT decoding algorithm with 100% probability.Simulation is also shown.
作者 黄诚 易本顺 甘良才 邓在辉 解文华
机构地区 武汉大学电子信息学院 中国电信武汉分公司
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2010年第3期121-125,共5页 Journal of Beijing University of Posts and Telecommunications
基金 国家自然科学基金项目(60672043)
关键词 喷泉码 中国剩余定理 混沌 中国变换码 fountain codes Chinese remainder theorem chaos Chinese transform codes
分类号 TN911.2 [电子电信—通信与信息系统]
  • 相关文献

参考文献12

  • 1Luby 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.
  • 2Luby 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.
  • 3Tee 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.
  • 4Casari 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.
  • 5Luby M. LT codes[C]//Proc of the 43th Annual IEEE Symposium on FOCS. Vancouver: [ s. n. ] , 2002: 271- 280.
  • 6Shokrollahi A. Raptor codes [ J ]. IEEE Trans on Inform Theory, 2006, 52(6) : 2551-2567.
  • 7Chang 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.
  • 8Chang 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.
  • 9Zheng Xinliang, Huang C T, Matthews M. Chinese remainder theorem based group key management [ C ] // Winston-Salem: [s. n. ], 2007: 266-271.
  • 10黄诚,易本顺.基于抛物线映射的混沌LT编码算法[J].电子与信息学报,2009,31(10):2527-2531. 被引量：11

二级参考文献25

  • 1Castura J, Mao Yongyi. Rateless coding over fading channels[J]. IEEE Communication Letters, 2006, 10 (1) : 46-48.
  • 2Ma Yuanyuan, Yuan Dongfeng, Zhang Haixia. Fountain codes and applications to reliable wireless broadcast system [ C] // Proceedings of IEEE Information Theory Workshop. Chengdu: IEEE Press, 2006: 66-70.
  • 3Tee 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 ] //Vehicular Technology Conference, VTC 2006-Spring. IEEE 63^rd. Melbourne: IEEE Press, 2006 : 22-26.
  • 4Venkiah A, Piantanida P, Poullia C, et al. Rateless coding for quasi-static fading channels using channel estimation accuracy [ C ]//IEEE International Symposium on Information Theory. Toronto: IEEE Press, 2008:2257- 2261.
  • 5Luby M. LT codes[C]//Proceedings of The 43^rd Annual IEEE Symposium on Foundations of Computer Science. Vancouver; IEEE Press, 2002. 271-282.
  • 6Shokrollah M A. Raptor codes[J]. IEEE Transactions on Information Theory, 2006, 52(6) : 2551-2567.
  • 7Makay D J. Fountain codes [J]. Proceedings of IEEE Communications, 2005, 152(6): 1062-1068.
  • 8Palanki P, Yedidia J S. Rateless codes on noisy channels [C] // IEEE International Symposium on Information Theory. Chicago: IEEE Press, 2004: 1-12.
  • 9Luby M. LT codes[C]. Proceedings of The 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, CA, 2002: 271-282.
  • 10Makay D J. Fountain codes[J]. Proceedings of IEEE, Communications, 2005, 152(6): 1062-1068.

共引文献48

同被引文献8

引证文献1

二级引证文献1

北京邮电大学学报
2010年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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