一种改进的混沌扩频序列优选算法  

An Improved Optimized Selection Algorithm of Chaotic Spread Spectrum Sequence

作　　者：张严平[1] 陆锐敏 

机构地区：[1]解放军理工大学通信工程学院,南京210007 [2]南京电讯技术研究所,南京210007

出　　处：《计算机工程》2016年第3期121-124,共4页Computer Engineering

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

摘　　要：混沌序列因其初值敏感性、复杂性高以及相关性强等特性适合作为扩频序列,但在实际应用中需要根据用户需求对混沌序列进行优选。为得到更多性能良好的混沌扩频序列,提出一种改进的优选算法,以Gold序列的平衡性和相关特性参数作为阈值,在互相关准则中结合对角移动和逻辑运算算法实现扩频序列的优选。基于多用户扩频通信系统的仿真结果表明,该算法相比对角移动算法和逻辑运算算法能够优选出更多混沌扩频序列,且优选出的混沌扩频序列相比Gold序列具有更强的相关性及抗多址干扰能力。Because of the high initial value sensitivity,complexity and strong correlation,the chaotic sequence is suitable to be used as spread spectrum sequence. But in practice,the chaotic sequences should be optimized selection. In order to achieve more chaotic sequences with excellent performance,an improved optimized selection algorithm is proposed. In this algorithm,the relevant parameters about balance and correlation of Gold sequence are taken as the threshold value,and it combines with diagonal movement algorithm and logical operation algorithm to realize optimized selection. The simulation results on multi-user spread spectrum communication system showthat more chaotic spread spectrum sequences can be achieved by the algorithm than diagonal movement algorithm and logical operation algorithm,and these sequences have better correlation and higher capability of multiple access interference than that of Gold sequence.

关 键 词：混沌序列 GOLD序列 优选算法 相关性 扩频通信 

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