Further combinatorial constructions for optimal frequency-hopping sequences |
| |
Authors: | Gennian Ge |
| |
Affiliation: | a Department of Mathematics, Zhejiang University, Hangzhou, Zhejiang 310027, PR China b Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba 305-8573, Japan |
| |
Abstract: | Frequency-hopping multiple-access (FHMA) spread-spectrum communication systems employing multiple frequency shift keying as data modulation technique were investigated by Fuji-Hara, Miao and Mishima [R. Fuji-Hara, Y. Miao, M. Mishima, Optimal frequency hopping sequences: A combinatorial approach, IEEE Trans. Inform. Theory 50 (2004) 2408-2420] from a combinatorial approach, where a correspondence between frequency-hopping (FH) sequences and partition-type cyclic difference packings was established, and several combinatorial constructions were provided for FHMA systems with a single optimal FH sequence. In this paper, by means of this correspondence, we describe more combinatorial constructions for such optimal FH sequences. As a consequence, more new infinite series of optimal FH sequences are obtained. |
| |
Keywords: | Combinatorial design Frequency-hopping sequence Optimal Partition-type cyclic difference packing Projective geometry |
本文献已被 ScienceDirect 等数据库收录! |
|