基于Logistic映射的低延时S-随机交织器  

Low Latency of S-Random Interleaver Based on Logistic Mapping

作　　者：茹国宝[1] 徐可[1] 张薇[1] 

机构地区：[1]武汉大学电子信息学院,湖北武汉430072

出　　处：《武汉大学学报（理学版）》2015年第3期291-294,共4页Journal of Wuhan University:Natural Science Edition

基　　金：国家自然科学基金资助项目(61072041)

摘　　要：针对S-随机交织器传统算法不能保证其搜索一定成功且存在延时较大的问题,本文提出了一种改进算法.改进算法基于Logistic混沌映射,提高了交织器的可控随机性,从而使算法的随机性和确定性得到较好的平衡,克服了传统算法的不足.仿真结果表明,帧长为1 000~5 000时,改进算法的交织延时比传统算法降低了2 294~97 380倍左右.在帧长为2 048时,改进算法比传统算法提高了0.05dB的编码增益,比第三代合作伙伴计划算法（3GPP）提高了0.1dB的编码增益.Aiming at the problems that traditional algorithm of S-random interleaver can not guarantee the success of its search and has large time delay,an improved algorithm is put forward.Based on Logistic chaotic mapping,the improved algorithm has the capability of controllable randomness,which makes the algorithm get better balance between randomicity and certainty,and overcome the shortcomings of traditional algorithm.As shown in the simulation results,when the frame length is from 1 000 to 5 000,the time delay of the improved algorithm is about 2 294-97 380 times lower than that of the traditional algorithm.when the frame length is 2 048,the coding gain of the improved algorithm is improved about 0.05 dB than that of the traditional algorithm,and also improved about 0.1dB than that of the 3rd Generation Partnership Project algorithm（3GPP）.

关 键 词：S-随机交织器 LOGISTIC映射 低延时 性能 

分 类 号：TN911.22[电子电信—通信与信息系统]