摘要
为了对构造宽间隔跳频码序列的两种算法 ,即随机平移替代法和随机均匀转移替代法的性能进行有效的衡量和比较。首先对广义和狭义宽间隔跳频码序列进行了初步探讨 ,然后对两种算法分别进行了研究、分析、仿真和比较 ;最后得出结论 :随机均匀转移替代法只能构造出广义宽间隔跳频码序列 ,其相关性性能稍好于随机平移替代法 ,但其均匀性性能较差 ,因而整体性能不如随机平移替代法 ;随机平移替代法可以构造狭义宽间隔跳频码序列 ,其性能比较理想 ,且易于实现 。
In this paper, the two algorithms to generate wide gap FH code sequence, namely the algorithm of random shift replace and the algorithm of even random shift replace, are investigated and compared. Firstly, the broad sense wide gap FH code sequence and the narrow sense wide gap FH code sequence are discussed. Then, the two algorithms are studied, analyzed, simulated and compared respectively. Finally, a conclusion is deduced that the algorithm of even random shift replace can only generate a broad sense wide gap FH code sequence with its correlation performance slightly better than that of the other, yet its uniformity performance poorer. So in general, it is inferior to the other. The algorithm of random shift replace can generate a narrow sense wide gap FH code sequence. Its performance is quite good. It can be realized easily, and its prospect is very attractive.
出处
《解放军理工大学学报（自然科学版）》
EI
2004年第4期29-33,共5页
Journal of PLA University of Science and Technology(Natural Science Edition)
关键词
宽间隔
跳频序列
跳频通信
抗干扰
wide gap
FH code sequence
FH communication
anti-jamming
