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

New Optimized Selection Algorithm of Chaotic Spread-spectrum Sequences

作　　者：罗冬梅[1] 何世彪[1] 谷诚[1] 

机构地区：[1]重庆大学通信工程学院,重庆400044

出　　处：《计算机工程》2010年第24期99-101,共3页Computer Engineering

摘　　要：混沌序列因其相关性好、对初值敏感、保密性强等特性成为直序码分多址(DS/CDMA)系统中性能较好的一种扩频码。为了提高DS/CDMA系统保密性、降低多址干扰,改进混沌序列的传统优选算法,研究混沌互相关优选,提出一种新的混沌扩频序列互相关优选算法,对所得的优选序列进行性能仿真比较。结果表明,该算法能提供较大的系统容量且抗多址干扰能力强。Chaotic sequence with its good correlation performance being sensitive to initial condition and hard to decrypt is used as spread-spectrum code in Direct Sequence Code Division Multiple Access（DS/CDMA） system. In order to improve the security of DS/CDMA system and decrease the multiple access interference, the traditional optimized selection algorithm of chaotic sequence is improved. By studying the chaotic cross-correlation optimization, a new cross-correlation optimized selection algorithm of chaotic spread-spectrum sequence is proposed, and the performance of the optimized sequence is simulated and compared. Experimental results show that the algorithm has better correlation performance, larger capacity and lower multiple access interference.

关 键 词：混沌序列 直序码分多址 优选算法 

分 类 号：TP914.4[自动化与计算机技术]