跳频通信组网研究

跳频电台组网是跳频通信的一种关键技术;首先介绍了跳频网络的拓扑结构、跳频电台组网的过程、方法,然后分析了跳频电台组网中跳频序列的碰撞、跳频图案设计的理论限,最后借助Matlab软件给出了用非重复跳频序列构造的一种跳频图案。     

战术跳频电台的组网运用及性能分析

本文阐述了战术跳频电台同步组网及异步组网的基本概念，工作原理及各自的优缺点，重点分析了两种组网方式的组网能力，所得结论与跳频电台抗干扰组网实验结果相吻合，对跳频电台技术体制论证及野战组网运用具有一定的参考价值。     

基于分组密码的跳频序列多址接入性能分析

基于3DES迭代型分组密码产生的跳频序列,构造了一种跳频组网的随机多址接入方案模型。在此基础上分析了跳频码分多址的系统接入性能,从理论上推导出跳频图案碰撞引起的误分组率、跳频组网的吞吐量和归一化吞吐率,证明数据分组长度M与可用频隙数q的比值是决定跳频码分多址系统性能的重要因素。计算机仿真结果验证了理论的正确性,同时也证明了基于分组密码的跳频序列具有较好的跳频多址组网性能。     

一种同步组网跳频信号的盲分离方法

针对多路混合的同步组网跳频信号,提出了一种基于时频分析的盲分离方法。首先利用同步组网的各跳频信号中各信号跳时相同、跳周期相同等特点,利用平滑伪魏格纳分布（SPWVD）提取信号在时频分布上的特征值。在此基础上,采用基于短时傅里叶变换（STFT）时频比方法对同步组网跳频电台信号进行分离。仿真实验表明,这种方法能有效分离同步组网电台跳频信号,且在跳频间隔较小时,依然具有良好的分离效果。     

对跳频通信同步状态的理解

本文就跳频电台通信、跳频通信组网和迟入网时的三种同步状态的不同含义及如何确保跳频通信同步进行了论述。     

一种异步组网跳频信号实时分选方法

提出一种异步组网电台的实时分选方法,该方法仅仅利用各时刻的跳频信号载频信息即可将多个跳频电台分开,计算量少,能实时分选。方法还考虑了实际应用中跳频信号转换载频期间存在的空隙和由于信道衰落信号丢失产生的空隙,增加了分选鲁棒性。最后仿真了载频估计精度、组网电台数目、丢失数据率对分选性能的影响。方法在工程中得到了应用,效果良好。     

短波差分跳频G函数法的构造和性能

差分跳频是CHESS电台的核心技术,它主要归结于一种C函数算法,这种函数集跳频图案和信息调制于一体。文中介绍了差分跳频的基本原理,G函数以及G函数的算法原理和构造方法,分析了G函数跳频图案的性能,并对其进行了检验。结果表明,该算法产生的跳频图案具有良好的随机性和均匀性。     

短波同步正交跳频网设计

常规短波跳频网由于自身的特性,常采用异步方式组网,限制了抗干扰能力的充分发挥。同步基准为设计性能优良的短波同步正交跳频网提供了条件。同步组网各跳频网络具有统一的时间基准,而异步组网时各跳频网络没有。为达到在任一瞬间,均不会发生频率碰撞,在总结常规跳频网络的特性的基础上,提出了基于同步基准的短波同步正交跳频组网的设计方法,并分析了短波同步正交跳频网的特性。     

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

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

基于附加频移的跳频同步组网设计与分析

为了提高跳频同步组网的频点利用率,提出了一种基于附加频移的跳频同步组网方案。首先,给出了基于附加频移跳频通信的基本模型和收发双方的实现方案;然后,基于该跳频通信模型,给出了同步组网的网络拓扑结构。该方案在整个工作频段内能够使用所有可用频点进行同步组网,提高了频点利用率。分析结果表明,在相同子网数下,该方案较常规跳频同步组网还具有更小的碰撞概率和比特差错率,同时该方案还增加了敌方的侦察分选难度和干扰难度。     

基于跳频的自适应频谱共享方案

 本文针对异种网络之间的频谱共享问题,提出了基于跳频的自适应频谱共享方案.该方案中 ,频谱注册网络负责配置跳频频率表等跳频参数,并且将其在覆盖区域内广播.频谱共享网络中的可重构终端（CR-MTs）使用认知无线电（CR）技术对周围频谱进行监测,通过跳频频谱共享策略实现通信.本文设计了跳频频谱共享的信号发射模型和信令交换机制,提出了不同情况下的干扰避免（IA）策略.最后,对跳频频谱共享方案的性能进行了分析,基于干扰计算模型得到的仿真结果表明该方案具有较好的IA性能.     

基于分组密码的跳频序列族构造

基于迭代型分组密码的理论体系,本文从工程实现的角度提出了一种用于跳频码分多址通信系统的新型跳频序列族构造方法.该算法基于密码学的加密机制,具有好的安全性和高的计算复杂度;算法的设计遵循了密码学的"混淆"和"扩散"准则,生成序列具有各项优异的性能指标.本文从安全性、随机性、均匀性、复杂度、组网特性及跳频间隔特性等各方面对产生的跳频序列进行了全面的理论分析,证明该算法具有理想的综合系统性能指标.在此基础上,利用VHDL语言设计并开发出相应的跳频加密芯片.经测试其性能稳定、运算速度快、输入方式灵活多样,已应用于实际的高速跳频通信系统中.     

Logistic映射跳频序列

本文给出一处基于ｌｏｇｉｓｔｉｌ映射的跳频序列设计方法、运用混沌的遍历理论分析了混跳频序列的渐近统计性能，混沌跳频序列保密性好，在频带内均匀分布，跳频间隔大，汉明相关函数近似服从Ｐｏｉｓｓｏｎ分布，是跳频通信的优选序列。     

Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences

Frequency hopping (FH) sequences have found wide applications in various modern FH spread-spectrum communications and radar systems. In FH spread-spectrum communications, the interference occurs when two distinct transmitters use the same frequency simultaneously. In order to evaluate the goodness of FH sequence design, the Hamming correlation function is used as an important measure. In this correspondence, by considering separately the maximum Hamming autocorrelation sidelobe H/sub a/, and the maximum Hamming cross correlation H/sub c/, several new lower bounds on the size p of the frequency slot set F, the sequence length L, the family size M, and correlation properties are established. The new periodic bounds include the known Lempel-Greenberger bounds as special case when M=2, and are tighter than the Seay bounds under certain conditions when M>2. Furthermore, the new bounds disclose more information on the relationship between the maximum autocorrelation sidelobe and the maximum cross correlation compared with the Lempel-Greenberger bounds and Seay bounds. Besides, the aperiodic FH bounds which have not yet been previously reported are also presented and discussed in this correspondence.     

混沌宽间隔跳频序列构造法的比较

为了保证对伪随机序列进行宽间隔处理后序列仍有最佳性能值,对基于混沌的跳频序列分别采用圆环频带法和对偶频带法进行宽间隔处理,并对经这两种方法处理所得到的宽间隔跳频序列的平均跳频间隔、相关性、平衡性进行分析和比较,仿真分析表明采用对偶频带法构造的宽间隔跳频序列更有利于抗多径衰落,而在含奇数个跳频点的多用户跳频组网中采用圆环频带法构造宽间隔跳频序则具有更强的抗干扰性能。     

Improving FH and FH/PN spread spectrum communications through PN M-ary phase sequences and signal editing

Pseudo-noise (PN) or direct sequence (DS) modulation, frequency hopping (FH) and their combination (i.e. the hybrid FH/PN approach) are common spread spectrum (SS) communications techniques used to achieve anti-jamming (AJ) and/or low probability of intercept (LPI). This study investigates the following FH and FH/PN related issues: (i) derive and apply M-ary phases of PN sequences to increase the AJ and transmission efficiency, (ii) use of erasure channel to reduce received errors and unreliable data, (iii) employ error correction coding and signal editing (SE) to improve communication surviv-ability, and (iv) adopt surface acoustic wave (SAW) devices to simplify the synchronization procedure in PN correlation. A special example is also given to illustrate the potential AJ improvement when an SS communications system employs both concatenated coding and concatenated SE techniques.     

Exploiting cognitive radios for reliable satellite communications

Satellite transmissions are prone to both unintentional and intentional RF interference. Such interference has significant impact on the reliability of packet transmissions. In this paper, we make preliminary steps at exploiting the sensing capabilities of cognitive radios for reliable satellite communications. We propose the use of dynamically adjusted frequency hopping (FH) sequences for satellite transmissions. Such sequences are more robust against targeted interference than fixed FH sequences. In our design, the FH sequence is adjusted according to the outcome of out‐of‐band proactive sensing, carried out by a cognitive radio module that resides in the receiver of the satellite link. Our design, called out‐of‐band sensing‐based dynamic FH, is first analyzed using a discrete‐time Markov chain (DTMC) framework. The transition probabilities of the DTMC are then used to measure the ‘channel stability’, a metric that reflects the freshness of sensed channel interference. Next, out‐of‐band sensing‐based dynamic FH is analyzed following a continuous‐time Markov chain model, and a numerical procedure for determining the ‘optimal’ total sensing time that minimizes the probability of ‘black holes’ is provided. DTMC is appropriate for systems with continuously adjustable power levels; otherwise, continuous‐time Markov chain is the suitable model. We use simulations to study the effects of different system parameters on the performance of our proposed design. Copyright © 2014 John Wiley & Sons, Ltd.     

The design and performance analysis for several new classes ofcodes for optical synchronous CDMA and for arbitrary-medium time-hoppingsynchronous CDMA communication systems

New families of spread-spectrum codes are constructed, that are applicable to optical synchronous code-division multiple-access (CDMA) communications as well as to arbitrary-medium time-hopping synchronous CDMA communications. Proposed constructions are based on the mappings from integer sequences into binary sequences. The authors use the concept of number theoretic quadratic congruences and a subset of Reed-Solomon codes similar to the one utilized in the Welch-Costas frequency-hop (FH) patterns. The properties of the codes are as good as or better than the properties of existing codes for synchronous CDMA communications: both the number of code-sequences within a single code family and the number of code families with good properties are significantly increased when compared to the known code designs. Possible applications are presented. To evaluate the performance of the proposed codes, a new class of hit arrays called cyclical hit arrays is recalled, which give insight into the previously unknown properties of the few classes of number theoretic FH patterns. Cyclical hit arrays and the proposed mappings are used to determine the exact probability distribution functions of random variables that represent interference between users of a time-hopping or optical CDMA system. Expressions for the bit error probability in multi-user CDMA systems are derived as a function of the number of simultaneous CDMA system users, the length of signature sequences and the threshold of a matched filter detector. The performance results are compared with the results for some previously known codes     

一种混沌跳频序列构造方法

提出了无需进行门限量化,直接将混沌映射轨道点的实数值表示为二进制小数,然后利用比特抽取产生跳频序列的新方法。理论分析和统计性能实验表明,在相同的条件下(频率数目和序列长度相同),该跳频序列的平衡性、跳频间隔和最大汉明相关值与其它方法产生的混沌跳频序列相当,然而其所需的迭代次数却可大大减少,并且可以极大地增强系统抗干扰、抗截获的能力,因此非常适合在跳频多址通信中应用。