The G Function Algorithm for CHESS System Based on Frequency Grouping

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=2BPH 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.