期刊文献+

基于分段线性混沌映射的Turbo喷泉实现

Implementation of Turbo-fountain based on piecewise linear chaotic map
下载PDF
导出
摘要 为了提高Turbo喷泉码在噪声信道上的性能,提出了一种基于分段线性混沌映射(PLCM)的Turbo喷泉实现方法.在Turbo喷泉预编码单元中采用PLCM方法实现混沌交织器的设计,同时使用相同的初始值、相同结构的PLCM来设计生成无限长序列的分支序列生成器,最大程度置乱信息序列.在AWGN信道和Rayleigh衰落信道下,采用提出的方法与随机交织方法进行了仿真.实验结果表明,该方法与使用随机交织方法相比,能够有效提高Turbo喷泉码的性能,使其更接近Shannon限,且具有灵活易控的特点. An implementation method based on piecewise linear chaotic map(PLCM) was put forward to improve the performance of Turbo-fountain code on noisy channels.In Turbo-fountain precoding unit,the PLCM method was employed to design the chaotic interleaving,and the PLCM with the same initial value and structure was applied to design the branch sequence generators for infinite sequence,which would make the scrambling degree of information sequence as large as possible.The proposed method and random interleaving method were adopted to perform the simulation on both AWGN channel and Rayleigh fading channel.The simulation results show that the proposed method can effectively improve the performance of Turbo-fountain code compared with the random interleaving method,and make it much closer to the Shannon limit.The proposed method is also flexible and easy to control.
出处 《沈阳工业大学学报》 EI CAS 2011年第1期108-112,共5页 Journal of Shenyang University of Technology
基金 国家自然科学基金资助项目(60808010) 武汉大学自主科研项目(6082003)
关键词 喷泉码 Turbo喷泉 分段线性混沌映射 噪声通道 软信息 交织器 置乱 吞吐量 fountain code Turbo-fountain piecewise linear chaotic map noisy channel soft information interleaving scrambling throughput
  • 相关文献

参考文献10

  • 1Luby M. LT codes [ C ]//Proceedings of the 43rd Annum IEEE Symposium on Foundations of Computer Science. Vancouver, Canada,2002:271 - 282.
  • 2ShokroUahi A. Raptor codes [ J ]. IEEE Transactions on Information Theory,2006,52 (6) :2551 - 2567.
  • 3Mackay D J C. Fountain codes [ J ]. IEEE Proceedings-Communications ,2005,152 (6) : 1062 - 1068.
  • 4Jenkac H, Hagenauer J, Mayer T. The Turbo-fountain [ J ]. European Transaction on Telecommunications, 2006,17:337 - 349.
  • 5Tarable A, Benedetto S. Efficiency of precode-only raptor codes and Turbo-fountain codes [ C ]//Information Theory Workshop. Chengdu, China, 2006: 61 - 65.
  • 6Tarable A, Benedetto S. Analysis of PCO raptor codes and Turbo-fountain codes on noiseless channels [ C]//IEEE International Symposium on Information Theory. Nice, France ,2007:416 - 420.
  • 7Li S J, Mou X Q, Cai Y L. Pseudo-random bit generator based on couple chaotic systems and its applications in streamcipher cryptography [ J ]. Lecture Notes in Computer Science ,2001,2247:316 -329.
  • 8肖东亮,焦秉立,林春蕾,陆建华.混沌理论在现代信道编码技术中的应用[J].电子学报,2007,35(10):1961-1967. 被引量:10
  • 9黄诚,易本顺.基于抛物线映射的混沌LT编码算法[J].电子与信息学报,2009,31(10):2527-2531. 被引量:11
  • 10杨华千,张伟,韦鹏程.基于分段线性映射与代数运算的混沌密码算法[J].电子学报,2008,36(8):1490-1494. 被引量:3

二级参考文献41

  • 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.
  • 3Park 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.
  • 4Venkiah 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.
  • 5Agarwal 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.
  • 6Ming 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.
  • 7Tarus 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.
  • 8Shokrollahi A. Raptor codes[J]. IEEE Transactions on Information Theory, 2006, 52(6): 2551-2567.
  • 9C 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.
  • 10R G Gallager. Low Density Parity Check Codes [M]. Cambridge, Massachusetts:MIT Press, 1963.53 - 73.

共引文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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