基于抛物线映射的混沌LT编码算法

黄诚; 易本顺

doi:10.3724/SP.J.1146.2008.01414

基于抛物线映射的混沌LT编码算法

doi: 10.3724/SP.J.1146.2008.01414

黄诚,
易本顺

计量
- 文章访问数: 3354
- HTML全文浏览量: 105
- PDF下载量: 873
- 被引次数: 0
出版历程
- 收稿日期: 2008-11-03
- 修回日期: 2009-03-26
- 刊出日期: 2009-10-19

Chaotic LT Encoding Algorithm Based on Parabolic Map

摘要

摘要: 该文提出一种基于抛物线映射和混沌置乱方法的LT编码算法。首先用混沌初始值作为密钥，采用抛物线映射产生混沌序列并转换为类均匀分布序列，再通过位置置乱算法生成LT码的度分布和度邻接数据序列，较传统的重要抽样方法具有更高的灵敏度，保留了理论分布的结构。实验结果表明，该算法具有实现结构简单、分组头部开销小、保密性好及高于传统重要抽样方法的性能。
- 混沌; 抛物线映射; 混沌置乱; 无码率码; LT码
Abstract: 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 furthermore is outperformed the traditional importance sampling method.

HTML全文

参考文献(1)

Luby M. LT codes[C]. Proceedings of The 43rd Annual IEEESymposium on Foundations of Computer Science, Vancouver,CA, 2002: 271-282.[2]Makay D J. Fountain codes[J].Proceedings of IEEE,Communications.2005, 152(6):1062-1068[3]林广荣, 林新荣, 依那等. 基于LDPC 码的数字喷泉编码[J].电子与信息学报.2008, 30(4):822-825浏览[4]肖东亮, 焦秉立, 林春蕾等. 混沌理论在现代信道编码技术中的应用[J]. 电子学报, 2007, 35(10): 1961-1967.Xiao D L, Jiao B L, and Lin C L, et al.. Application study onchaotic theory for modern channel coding[J]. Acta ElectronicaSinica, 2007, 35(10): 1961-1967.[5]Park Dohyung and Chung Sae-Young. Performancecomplexity tradeoffs of rateless codes [C]. 2008 IEEEInternational Symposium on Information Theory, Toronto,CA, 2008, 7: 2056-2060.[6]Venkiah A, Piantanida P, and Poullia C, et al.. Ratelesscoding for quasi-static fading channels using channelestimation accuracy [C]. 2008 IEEE International Symposiumon Information Theory, Toronto, CA, 2008, 7: 2257-2261.[7]Agarwal S, Hagedorn A, and Trachtenberg A. Adaptiverateless coding under partial information[C]. InformationTheory and Applications Workshop, San Diego, USA , 2008,2: 5-11.[8]Ming Xiao, Aulin T, and Medard M. Systematic binarydeterministic rateless codes[C]. 2008 IEEE InternationalSymposium on Information Theory, Toronto, CA, 2008, 7:2066-2070.[9]Tarus H, Bush J, Irvine J, and Dunlop J. ExploitingRedundancies to Improve Performance of LT Decoding [C].Communication Networks and Services Research Conference2008 6th Annual, Halifax, CA, 2008, 5: 198-202.[10]蔡国权, 宋国文, 于大鹏. Logistic 映射混沌扩频序列的性能分析[J]. 通信学报, 2000, 21(1): 60-63.Cai G Q, Song G W, and Yu D P. On properties oflogistic-map chaotic spread spectrum sequences[J]. Journalon Communications, 2000, 21(1): 60-63.[11]Shokrollahi A. Raptor codes[J].IEEE Transactions onInformation Theory.2006, 52(6):2551-2567

施引文献

资源附件(0)

访问统计