采用模运算和混沌的喷泉码-北京邮电大学学报.PDF

2010年6月 北 京 邮 电 大 学 学 报 Jun.2010 第33卷 第3期 Journal of Beijing University of Posts and Telecommunications Vol.33 No.3 摇 摇 文章编号:1007鄄5321(2010)03鄄0121鄄05 采用模运算和混沌的喷泉码 1,2 1 1 1 1 黄摇 诚 ,摇 易本顺 ,摇 甘良才 ,摇 邓在辉 ,摇 解文华 (1郾 武汉大学 电子信息学院,武汉430079;2郾 中国电信武汉分公司,武汉430071) 摘要:为了解决高速无线网络中的传输有效性问题,提出一类新的喷泉码机制及其编译码算法,称为中国变换 (CT)码. 不同于基于因子图和异或(XOR)运算的现有喷泉码机制,该码的编码算法通过在素数集中均匀选取素数 将有限长度的原始分组不断分解为包含余数的编码分组,通过混沌位置置乱算法生成编码分组,接收端只要从这 些编码分组中接收固定数量的分组,即能以100%的概率恢复译码. 仿真实验验证了新喷泉码的机制及构造的有 效性. 关摇 键摇 词:喷泉码;中国剩余定理;混沌;中国变换码 中图分类号:TN911郾2摇 摇 摇 摇 文献标志码:A Fountain Codes Based on Modulo and Chaos 1,2 1 1 1 1 HUANG Cheng ,摇 YI Ben鄄shun ,摇 GAN Liang鄄cai ,摇 DENGZai鄄hui ,摇 XIE Wen鄄hua (1郾Electronic Information School,Wuhan University,Wuhan430079,China; 2郾China Telecom Wuhan Branch Company,Wuhan430071,China) Abstract:A new class of fountain codes named Chinese transform (CT) codes is proposed to solve the problemoftheefficienttransmissioninhighspeedwirelessnetwork. Differentfromexistingfountaincodes based on Tanner graph and exclusive OR (XOR) operations,the encoding of CT codes transformsfinite original symbols into theoretically infinite encoding symbolswhich are generated by integers selected uni鄄 formly from the set of primeswhich are then enveloped into packets by chaotic position scrambling algo鄄 rithm. When enough packets are receivedfrom these packets,original symbolscan be recovered accord鄄 ing to the CT decoding algorithm with 100% probability. Simulation is also shown. Key words:fountain codes;Chinese remainder theorem;chaos;Chinese transform cod