New Families of Optimal Frequency Hopping Sequence Sets

Frequency hopping sequences (FHSs) are employed to mitigate the interferences caused by the hits of frequencies in frequency hopping spread spectrum systems. In this paper, we present combinatorial constructions for FHS sets, including direct constructions by using cyclotomic classes, recursive constructions based on cyclic difference matrices, merging blocks, and discrete logarithm. By these constructions, a number of series of new FHS sets are then produced. These FHS sets are optimal with respect to the Peng-Fan bounds.