Theoretical bounds are given for the number and period of nonrepea, ting Frequency Hopping (FH) sequences in asynchronous frequency hopping multiple access, with a guaranteed maximum number of pairwise hits. Practical constructions for families of nonrepeating sequences which reach the theoretical bounds are also given in this paper.
Seay T S. Hopping Patterns for Bounded Mutual Interference in Frequency Hopping Multiple[2]Access. Proc. 1982 IEEE MILCOM Conference. Boston, Massachusetts: 1982, 22.3.1-22.3.6.[3]Lempel A, Greenberger H. IEEE Trans, on IT, 1974, IT-20(1):90-94.[4]Solomon G. Optimal Frequency Hopping Sequences for Multiple Access. AD-915852, 1973, 33-35.[5]梅文华.通信学报,1991,12(1): 70-73.[6]Shaar A A, Davies P A. IEE Proc.-F, 1984, 131(7):719-724.[7]Maric S V, Titlebaum E L. IEEE Trans. on AES, 1990, AES-26(6):1035-1039.[8]杨义先.电子科学学刊,1992,14(6): 588-595.