采用模运算和混沌的喷泉码

doi:10.13190/jbupt.201003.121.huangch

北京邮电大学学报 ›› 2010, Vol. 33 ›› Issue (3): 121-125.doi: 10.13190/jbupt.201003.121.huangch

采用模运算和混沌的喷泉码

黄诚^1,2, 易本顺¹，甘良才¹，解文华¹，邓在辉¹

(1. 武汉大学电子信息学院, 武汉 430079;
2. 中国电信武汉分公司, 武汉 430071)

收稿日期:2009-08-01 修回日期:2010-03-05 出版日期:2010-06-28 发布日期:2010-05-14
通讯作者: 黄诚 E-mail:wtvoid@163.com
基金资助:
国家自然科学基金项目（60672043）

Fountain Codes Based on Modulo and Chaos

HUANG Cheng^1,2, YI Ben-shun¹, GAN Liang-cai¹, XIE Wen-hua¹, DENG Zai-hui¹

(1. Electronic Information School, Wuhan University, Wuhan 430079, China; 
2. China Telecom Wuhan Branch Company, Wuhan 430071, China)

Received:2009-08-01 Revised:2010-03-05 Online:2010-06-28 Published:2010-05-14

摘要/Abstract

摘要：

为了解决高速无线网络中的传输有效性问题，提出一类新的喷泉码机制及其编译码算法，称为中国变换

(CT)码. 不同于基于因子图和异或(XOR)运算的现有喷泉码机制，该码的编码算法通过在素数集中均匀选

取素数将有限长度的原始分组不断分解为包含余数的编码分组，通过混沌位置置乱算法生成编码分组，

接收端只要从这些编码分组中接收固定数量的分组，即能以100%的概率恢复译码. 仿真实验验证了新喷

泉码的机制及构造的有效性. 

关键词: 喷泉码, 中国剩余定理, 混沌, 中国变换码

Abstract:

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. 

Key words: fountain codes, Chinese remainder theorem, chaos, Chinese transform codes

黄诚易本顺甘良才解文华邓在辉. 采用模运算和混沌的喷泉码[J]. 北京邮电大学学报, 2010, 33(3): 121-125.

HUANG Cheng, YI Ben-shun, GAN Liang-cai, XIE Wen-hua,DENG Zai-hui.

Fountain Codes Based on Modulo and Chaos [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2010, 33(3): 121-125.

[1] Luby 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.
[2] Luby M, Watson M, Gasiba T, et al. Raptor codes for reliable download delivery in wireless broadcast systems//CCNC 2006. Las Vegas: , 2006: 192-197.
[3] Tee 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//VCT 2006-Spring. Melbourne: , 2006: 22-26.
[4] Casari P, Rossi M, Zorzi M. Towards optimal broadcasting policies for HARQ based on fountain codes in underwater networks//WONS 2008. Garmisch Partenkirchen: , 2008: 11-19.
[5] Luby M. LT codes//Proc of the 43th Annual IEEE Symposium on FOCS. Vancouver: , 2002: 271-280.
[6] Shokrollahi A. Raptor codes[J]. IEEE Trans on Inform Theory, 2006, 52(6): 2551-2567.
[7] Chang 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.
[8] Chang 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.
[9] Zheng Xinliang, Huang C T, Matthews M. Chinese remainder theorem based group key management//Winston-Salem: , 2007: 266-271.
[10] 黄诚, 易本顺. 基于抛物线映射的混沌LT编码算法[J]. 电子与信息学报, 2009, 31(10): 2527-2531. Huang Cheng, Yi Benshun. Chaotic LT encoding algorithm based on parabolic map. Journal of Electronics & Information Technology, 2009, 31(10): 2527-2531.
[11] 蔡国权, 宋国文, 于大鹏. Logistic映射混沌扩频序列的性能分析[J]. 通信学报, 2000, 21(1): 60-63. Cai Guoquan, Song Guowen, Yu Dapeng. On properties of logistic-map chaotic spread spectrum sequences[J]. Journal of China Institute of Communications, 2000, 21(1): 60-63.
[12] 黄诚, 易本顺. 喷泉码的Logistic映射实现[J]. 北京邮电大学学报, 2009, 32(1): 103-107. Huang Cheng, Yi Benshun. Implementation of fountain codes using logistic map. Journal of Beijing University of Posts and Telecommunications, 2009, 32(1): 103-107.

[1]	阎昕宇, 杨华, 徐思远, 蒋国平, 林庚辰. 降噪载波索引差分混沌键控通信系统[J]. 北京邮电大学学报, 2022, 45(3): 74-80.
[2]	王永, 龚建, 王明月, 江功坤. 一种整数混沌映射的伪随机数生成器[J]. 北京邮电大学学报, 2022, 45(1): 58-62.
[3]	张雷, 陈川, 谭淇匀, 郝茂鑫, 杨学康. 结合S盒与混沌映射的图像加密算法[J]. 北京邮电大学学报, 2021, 44(6): 40-47.
[4]	朱伟光, 郑海宇, 张欣雷, 张志涛, 胡善文. 新型两级超宽带混沌电路的设计与实现[J]. 北京邮电大学学报, 2021, 44(3): 120-124.
[5]	汤永利, 赵明洁, 李丽香. 压缩感知安全理论研究[J]. 北京邮电大学学报, 2020, 43(3): 125-130.
[6]	马英杰, 赵耿, 范晓红, 张昕然, 高原. 面向5G F-OFDM的量子混沌扩展序列算法[J]. 北京邮电大学学报, 2019, 42(2): 90-94.
[7]	马英杰, 李亚, 谢绒娜. 立体网格多涡卷混沌系统及其电路实现[J]. 北京邮电大学学报, 2017, 40(2): 84-87.
[8]	马英杰, 李彦兵, 杨亚涛. 变形蔡氏混沌系统及其电路实现[J]. 北京邮电大学学报, 2015, 38(1): 36-39.
[9]	雷维嘉, 郭旭静, 王换换, 谢显中. 采用喷泉码和自适应调制的多中继传输机制[J]. 北京邮电大学学报, 2014, 37(2): 68-73.
[10]	张文哲. 短喷泉码硬译码性能的分析与优化[J]. 北京邮电大学学报, 2013, 36(6): 79-83.
[11]	杨华蒋国平. 基于Walsh码的正交差分混沌键控通信方案[J]. 北京邮电大学学报, 2012, 35(6): 20-24.
[12]	张海波, 王晓湘, 李方伟. OFDMA系统中的子载波和功率联合TCNN优化[J]. 北京邮电大学学报, 2012, 35(6): 102-106.
[13]	马英杰蒋华池亚平. 混沌超宽带频率自适应DAA设计[J]. 北京邮电大学学报, 2012, 35(5): 115-118.
[14]	张剑贤,杨银堂,周端,董刚,赖睿,高翔. 自适应混沌遗传退火的片上网络映射[J]. 北京邮电大学学报, 2011, 34(4): 6-9.
[15]	孙艳宾,谷利泽,郑世慧,杨义先,孙燕. 基于聚合签名的多方合同签署协议[J]. 北京邮电大学学报, 2011, 34(2): 8-11.

采用模运算和混沌的喷泉码

Fountain Codes Based on Modulo and Chaos

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价