摘要
为了提高异步直扩序列码分多址 (DS/CDMA)系统的容量和保密性能 ,从整个扩频序列集合相关函数的均方值出发 ,对一类由一维混沌映射产生的混沌直扩序列与传统的伪随机序列如m序列、Gold序列和Kasami序列等 ,在异步DS/CDMA系统中作了性能比较研究。计算机仿真表明 ,其性能与传统序列相当 ,其序列数较m序列数多 ,适于作CDMA系统的扩频码 ,并由此提出了一种混沌直扩序列的优选方法。
In order to improve the capacity and security of asynchronous direct sequence (DS) code division multiple access (CDMA) system, this paper compares the performance of digital chaotic direct spreading sequences generated by one dimensional chaotic maps with that of the conventional pseudo noise (PN) sequences such as m sequences, Gold sequences and Kasami sequences in the DS/CDMA system based on the mean square values of the aperiodic correlation function of all sequences in the set. By simulation, it shows that their performances are almost identical and the number of the obtained chaotic sequences is larger than that of m sequences. Hence the chaotic sequences are good candidates of spreading sequences for CDMA. A new optimized method of chaotic direct spread spectrum sequences is also proposed.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2002年第8期117-120,共4页
Systems Engineering and Electronics
基金
国防抗干扰通信重点试验室预研基金资助课题 (99JS0 4 8 1 JB5 10 1)
