摘要
为有效提高军用通信系统的抗干扰和反侦察性能,可采用跳码直扩及扩展的跳码/跳频通信方案,系统直扩伪随机序列随时间跳变,序列的线性复杂度与非线性复杂度性能是系统抗干扰和抗截获的重要保证;以Berlekamp-Massey迭代算法对序列进行线性复杂度分析,以生成算法对序列进行Lempel-Ziv非线性复杂度测试,结果表明GOLD序列线性复杂度低,在跳码系统中应用会存在抗相关干扰和抗截获方面的隐患,而DFS结构的混沌序列在随机特性尤其是线性复杂度与非线性复杂度方面的性能良好,因而在跳码直扩系统中具有重要的应用价值。
The performance of anti--jamming and eounterreeonnaissance is enhanced in CH--DSSS or CH--FH System. Berlekamp-- Massey iterative algorithm is used to analyze the linear complexity of GOLD sequence and DFS chaos sequence, and the production algorithm is used to analyze the Lempel--Ziv complexity. It shows that sequences with low complexity will tamper with the performance of anti--jam- ruing and count , whereas, the DFS ehaotic sequence has the almost perfect linear complexity and finer Lempel--Ziv complex ity, so application of DFS chaotic sequence is preferable in CH--DSSS System.
出处
《计算机测量与控制》
CSCD
北大核心
2010年第7期1599-1601,1605,共4页
Computer Measurement &Control
