一种迭代方法的RS喷泉码的编译码算法  

Iterative coding and decoding algorithm of RS fountain code

作　　者：雷维嘉[1] 张鑫[1] 谢显中[1] 

机构地区：[1]重庆邮电大学个人通信研究所,重庆400065

出　　处：《重庆邮电大学学报（自然科学版）》2010年第3期307-311,共5页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家自然科学基金(60872037);重庆市自然科学基金(2008BB2411);重庆市教委应用基础研究基金(KJ080508)资助~~

摘　　要：数字喷泉编码可以解决类似广播通信等应用中因为重发带来的效率下降和时延增加等问题,而Reed-Solo-mon编码(RS码)在理论上可以作为数字喷泉码使用,但是传统的RS译码算法太过复杂,针对这个问题,提出了RS数字喷泉码的编码方案,给出了RS数字喷泉码的迭代译码算法,与传统RS译码方案相比,该方案运算量小,译码延时降低明显。仿真结果表明,采用RS数字喷泉码的系统能够明显地降低数据包的发送数量,提高系统效率。In broadcast communication system,the retransmission of date decreases communication efficiency and increases transmission delay.Digital fountain code can solve such kind of problems and Reed-Solomon code can be used as digital fountain code theoretically,but the conventional decoding methods of RS code were too complicated.To solve these problems,the paper at first presented the coding algorithm of RS fountain code and then described the iterative decoding algorithm in details.Compared with the conventional decoding algorithm,the proposed algorithm decreases the computation and decoding delay obviously.Simulations show that this RS digital fountain code can evidently lower the number of sending dates and improve the efficiency of the system.

关 键 词：RS编码 数字喷泉码 编译码算法 迭代 

分 类 号：TN92[电子电信—通信与信息系统]