Optimal frequency hopping sequences: a combinatorial approach
Optimal frequency hopping sequences: a combinatorial approach
复制标题
DOI：
10.1109/tit.2004.834783
复制
发表时间：
2004-10
影响因子：
2.5
通讯作者：
R. Fuji-Hara;Y. Miao;Miwako Mishima
中科院分区：
文献类型：
--
作者：
R. Fuji-Hara;Y. Miao;Miwako Mishima
本文从组合的角度研究了采用多频移键控（MFSK）作为数据调制技术的跳频多址（FHMA）扩频通信系统。首先建立了最优跳频序列与划分型差分填充之间的对应关系。凭借这种对应关系，FHMA系统与一个单一的最佳FH序列的每一个被构造从各种组合结构，如仿射几何，循环设计，和差家庭。组合递归结构也提出。由此得到了许多新的最优跳频序列的无穷级数。这些新的FH序列在超宽带（UWB）通信系统中也是有用的。
Frequency hopping multiple access (FHMA) spread-spectrum communication systems employing multiple frequency-shift keying (MFSK) as data modulation technique are investigated from a combinatorial approach. A correspondence between optimal frequency hopping (FH) sequences and partition-type difference packings is first established. By virtue of this correspondence, FHMA systems with a single optimal FH sequence each are constructed from various combinatorial structures such as affine geometries, cyclic designs, and difference families. Combinatorial recursive constructions are also presented. Many new infinite series of optimal FH sequences are thus obtained. These new FH sequences are also useful in ultra wideband (UWB) communication systems.