基于频率分组的CHESS系统G函数算法研究  

The G Function Algorithm for CHESS System Based on Frequency Grouping

作　　者：岑翼刚[1] 孙德宝[1] 尉宇[1] 

机构地区：[1]华中科技大学控制科学与工程系,武汉430074

出　　处：《电子与信息学报》2006年第4期663-666,共4页Journal of Electronics & Information Technology

基　　金：航天技术创新基金资助课题

摘　　要：该文在现有研究结果的基础上,针对CHESS系统提出了一种新的G函数算法,该算法将总频率集中的频点随机分为m=2BPH个子频率集,根据待发送的信息以及信息码与子频率集的对应关系得出下一跳的频点,由检验结果看出该方法在以往的基础上提高了系统的一维均匀性、二维连续性及随机性,取得了较好的效果。On the basis of existing references, this paper proposes a new G function algorithm for the HF high speed FH CHESS radio system. In the algorithm, the frequencies are grouped into m=2^BPH subsets. The next hopping frequency is chosen according to the coding series and the corresponding relationship between the codes and the frequency subsets. The performance test results show that the algorithm has more superiority in 1-dimensional uniformity, 2-dimensional continuity and randomness of the hopping series compared with previous G function algorithm.

关 键 词：短波跳频 CHESS系统 G函数 频率分组 

分 类 号：TN971.1[电子电信—信号与信息处理]