用于跳频码分多址通信的混沌跳频序列

最近提出的混沌跳频序列具有均匀性、保密性好的优点,但存在较大的汉明相关值,本文给出了一种减小混沌跳频序列汉明相关值的方法,该方法的构造的跳频序列是帆努利随机序列,汉明相关函数服从Ｐｏｉｓｓｏｎ分布,在跳频码分多址（ＦＨ／ＣＤＭＡ）系统中,,这种混沌跞频序列的系统容量与常规跳频序列基本相同。     

Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions

Frequency hopping spread spectrum and direct sequence spread spectrum are two main spread coding technologies in communication systems. Frequency hopping sequences are needed in frequency hopping code-division multiple-access (FH-CDMA) systems. In this paper, four algebraic and a combinatorial constructions of optimal sets of frequency hopping sequences with new parameters are presented, and a number of bounds on sets of frequency hopping sequences are described.     

跳频序列设计理论的研究进展

跳频技术具有抗干扰和多址组网性能，在军事无线电通信、民用移动通信、现代雷达和声纳等电子系统中具有重要的应用。跳频序列用于控制载波频率随机时间的变化规律，其性能对跳频系统的性能有重大影响。本文综述跳频序列设计理论的研究成果，并指出今后的发展方向。     

余弦映射法产生混沌跳频序列及宽间隔的改进

提出了一种基于余弦映射法产生十进制混沌跳频序列的方案，并对此方案所产生的十进制混沌序列在跳频通信系统中的性能进行了分析，包括用C语言进行模拟计算，使性能达到良好。在此基础上，通过查表和使用DSP使该方案得到落实并结合对偶宽间隔法产生了宽间隔的跳频序列，使跳频间隔得到了大大的改善。     

用DES算法构造跳频码序列发生器的实现研究

基于计数式TOD的跳频码序列产生算法实际上是对TOD这一特殊信息流序理的分组加密变换，我们建议使用DES算法构成分组加密变换。所设计的跳频码序列发生器，在输出序列的均匀性、相关性、复杂性、游程、频隙滞留和FPGA上的可实现性等方面都能满足实际要求。这是一个性能良好、也便于FPGA实现的跳频码发生器方案。     

慢跳频的伪随机序列

本文基于ＧＦ（２）域上的增广质数序列,提出了一类ＧＦ（Ｐ＾Ｋ）域上的增广质数跳频序列,对其差的游程特性进行了改进,并根据慢跳频系统的要求进行了宽间隔处理。计算机模拟分析表明：宽间隔增广质数跳频序列具有良好的汉明相关特性,是一类优良的跳频序列,适合于慢跳频系统。     

蓝牙自适应跳频序列的性能分析

蓝牙自适应跳频序列性能优越,有着广泛的应用前景.通过仿真计算,分析了蓝牙自适应跳频序列的频率均匀性、汉明相关特性、跳频间隔分布特性、序列的线性复杂度、组网特性和系统容量.     

一种基于Logistic映射的混沌跳频序列

基于Logistic映射,提出了一种产生混沌跳频序列的新方法.该方法是先对Logistic映射的轨道点进行多值量化,然后利用比特抽取产生所需的混沌跳频序列.性能分析和数值实验表明,在相同的条件下(频率数目和序列长度相同),其平衡性、跳频间隔和最大汉明相关值与其它方法产生的混沌跳频序列相当,然而其所需的迭代次数却大大减少了,因此非常适合在跳频多址通信中应用.     

Optimal frequency hopping sequences: a combinatorial approach

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.     

Blind Hopping Phase Estimator in Frequency‐Hopped FM and BFSK Systems

A blind hopping phase estimator is proposed for the demodulation of received signals in frequency‐hopping spread spectrum systems. The received signals are assumed to be bandwidth limited with a shaping filter, modulated as frequency modulation (FM) or binary frequency shift keying (BFSK), and hopped by predetermined random frequency sequences. In the demodulation procedure in this paper, the hopping frequency tracking is accomplished by choosing a frequency component with maximum amplitude after taking a discrete Fourier transform, and the hopping phase estimator performs the conjugated product of two consecutive signals and moving‐average filtering. The probability density function and Cramer‐Rao low bound (CRLB) of the proposed estimator are evaluated. The proposed scheme not only is very simple to implement but also performs close to the CRLB in demodulating hopped FM/BFSK signals.     

Maximal length sequences for frequency hopping

Normally, frequency hopping sequences for spread-spectrum communication systems are obtained by selecting groups of elements of binary m sequences. An alternative to using groups of binary m-sequence elements is developed. It involves obtaining nonbinary m sequences with the number of desired hopping frequencies equal to the number of symbols in the finite field which the nonbinary m sequence is over. The grouping of elements of binary m sequences does not necessarily have the m sequences. In addition, the autocorrelation function of the nonbinary m sequence has a maximal period, whereas the frequency hopping sequences obtained from the grouping of elements of binary m sequences may not have a maximal period     

一类最优调频序列的线性复杂度

For the anti-jamming purpose, frequency hopping sequences are required to have a large linear span. In this paper, we firstly give the linear span of a class of optimal frequency hopping sequences. The results show that the linear span is very small compared with their periods. To improve the linear span, we transform these optimal frequency hopping sequences into new optimal frequency hopping sequences with large linear span by using a general type of permutation polynomials over a finite field. Furthermore, we give the exact values of the linear span of the transformed optimal frequency hopping sequences.     

多网跳频序列设计

提出了一种跳频序列的设计方法,将其应用于构建多子网的通信系统可以有效降低子网间的 相互 干扰。该方法在序列设计中引入了子网间用户的空间分布特性,在序列构造中充分利用了传 播时延和传播衰减来降低序列间的频点干扰。理论推导表明,该方法设计的跳频序列可以显 著降低子网间跳频序列的有效碰撞,在相同的频带利用率下比频分组网方式有更强的抗干扰 能力。     

Optimal large linear complexity frequency hopping patterns derivedfrom polynomial residue class rings

We construct new sequences over finite rings having optimal Hamming correlation properties. These sequences are useful in frequency hopping multiple-access (FHMA) spread-spectrum communication systems. Our constructions can be classified into linear and nonlinear categories, both giving optimal Hamming correlations according to Lempel-Greenberger (1974) bound. The nonlinear sequences have large linear complexity and can be seen as a generalized version of GMW sequences over fields     

Frequency hopping sequences with small cross-correlation

The cross-correlation of frequency hopping sequences obtained from non-binary m-sequences represented as vector m-sequences is developed. Preferred pairs of these vector m-sequences then yield vector or frequency hopping m-sequences which are shown to have small three-and four-level cross-correlation values. Modified preferred pairs are developed that yield frequency hopping m-sequences with reduced peak cross-correlation.     

跳频周期和跳频间隔的最大条件熵射频隐身设计方法

为提高跳频通信系统的被截获性能,该文以跳频周期和跳频间隔为研究对象,提出一种基于最大条件熵的跳频周期、跳频间隔射频隐身联合设计方法。该方法以跳频系统先验数据为样本空间,以拉格朗日乘子为优化粒子,利用混合混沌粒子群优化(HCPSO)算法对最大条件熵的对偶规划进行优化计算。与单阈值方法(STM)和双阈值方法(DTM)的对比仿真结果表明:该文提出的最大熵方法(MEM)具有最大的跳频周期、跳频间隔不确定性和最小的截获概率,且针对不同威胁因子具有较高的环境区分度。因此,MEM具有较好的射频隐身性能,可以有效提高搭载平台的生存能力。     

Time-frequency hopping sequences with three no hit zones

Based on the idea of no hit zone (NHZ) in frequency hopping (FH) systems, new sequences with three no hit zones (T-NHZ) in time-frequency hopping (TFH) systems are presented. With the T-NHZ in the time- frequency (TF) correlation functions, the proposed T-NHZ sequences can be directly employed in time-frequency hopping code division multiple access (TFH-CDMA) communication systems to reduce or eliminate multipath interference. Simulation results show that T-NHZ sequences can achieve much better bit error performance than the NHZ sequences and the traditional FH sequences.

无线通信中的跳频技术及其应用

介绍了跳频通信原理及跳频通信具有的特点,并重点论述了跳频图案的设计、同步技术、频率合成技术、跳频组网及自适应跳频等跳频通信中的关键技术,总结了跳频技术的应用,分析了跳频技术的发展趋势.     

基于Tent映射双向耦合映象格子的宽间隔跳频序列及其性能分析

为实时产生宽间隔跳频序列,提出了一种基于Tent映射双向耦合映象格子的宽间隔跳频序列实时产生方法.该方法采用多比特量化和比特抽取相结合的量化方法和改进的平移替代法进行宽间隔处理.仿真结果表明,实时产生的宽间隔跳频序列服从均匀分布,具有宽的跳频间隔、良好的汉明相关性和复杂的相空间分布.     

Analysis of protocol sequences for slow frequency hopping

An error probability bound for protocol sequences is derived for frame asynchronous access on a slow frequency hopping channel. This bound depends on the maximum and average cyclic Hamming correlation properties of the protocol sequences used. Constructions of protocol sequences with good cyclic correlation properties are given.