Two classes of optimal frequency-hopping sequences with new parameters

摘要

Direct-sequence spread spectrum and frequency-hopping (FH) spread spectrum are two main spread-coding technologies. Frequency-hopping sequences (FHSs) achieving the well-known Lempel-Greenberger bound play an important part in FH code-division multiple-access systems. Our objective is to construct more FHSs with new parameters attaining the above bound. In this paper, two classes of FHSs are proposed by means of two partitions of Zv, where v is an odd positive integer. It is shown that all the constructed FHSs are optimal with respect to the Lempel-Greenberger bound. By choosing appropriate injective functions, infinitely many optimal FHSs can be recursively obtained. Above all, these FHSs have new parameters which are not covered in the former literature.