一种贪婪的异构多信道并行合作频谱感知方法

为了同时对多个异构信道进行有效地合作频谱感知,并克服现有方法中只考虑检测准确性而忽略感知开销和系统效益,忽略不同认知用户对不同异构信道感知性能的差异以及参与合作感知的认知用户较多等问题,提出了一种贪婪的异构多信道并行合作频谱感知方法。根据对感知开销和传输收益的定义,充分考虑不同认知用户对不同异构信道感知性能的差异,利用贪婪算法在多个认知用户和多个异构信道间最优地进行感知任务分配,使总系统效益最大。仿真结果表明,所提方法与基于迭代匈牙利的并行合作频谱感知方法、改进的基于迭代匈牙利的并行合作频谱感知方法和随机的合作频谱感知方法相比,能够获得较高的总系统效益,且所需的参加合作感知的认知用户数较少。     

基于非理想感知的认知无线电系统感知时间与频谱分配联合优化算法

针对非理想感知情况下感知时间与频谱分配联合优化问题,同时考虑漏检与主用户重新占用频谱两种场景所造成的主次用户碰撞,并通过量化主用户对认知用户的干扰,给出有无主用户存在时认知系统可获得的吞吐量。在总传输功率约束以及对主用户的最大干扰功率约束两个限制条件下,以最大化系统平均吞吐量为优化目标,给出感知时间与频谱分配联合优化算法。算法首先通过折半法搜索最优感知时间,在既定的感知时间下,将子信道分配给能获得最大平均吞吐量的认知用户,在此基础上,利用凸优化相关理论求得最优功率分配。仿真结果表明,本文所提算法相比于传统频谱分配算法系统平均吞吐量性能提升了10%左右。     

基于网络编码的衰落信道频谱感知算法

针对传统认知无线电网络中频谱状态转换频繁和频谱检测时延长的问题,提出基于随机线性网络编码的累积和能量检测频谱感知算法。该算法在主用户信道中引入随机线性网络编码,利用网络编码对频谱的整形作用,使频谱状态转换稀疏,频谱结构更规律化,减小频谱检测时延,提高系统吞吐率。此外,针对传统累积和能量检测算法抗衰落性能差的问题,通过比较该算法在五种衰落信道下的检测时延和吞吐率,研究该算法的抗衰落性能。实验结果表明,在一定的虚警概率下,该算法有效降低了检测时延,提高了吞吐率及抗衰落能力,能够更好地适应复杂的衰落信道环境。     

一种非理想感知条件下的双门限机会频谱接入策略

为了有效提高认知网络中次用户的吞吐率性能,提出了一种应用于非理想感知条件下的双门限机会频谱接入策略。该策略能在次用户对信道占用情况感知非理想的条件下,综合考虑次用户的信道质量和非准确的信道占用信息,使次用户在信道感知为空闲和占用时分别以不同的信道质量门限选择接入信道,从而最大程度地利用信道质量较好的传输机会,提高次用户的吞吐率性能。结合本策略,建立了以次用户的有效吞吐率最大化为目标、以对主用户的干扰程度为约束条件的优化问题,并在次用户对信道感知存在误差的条件下给出了最优门限的设计方法。仿真结果表明,所提出的双门限机会频谱接入策略能够在非理想感知条件下显著提高次用户的有效吞吐率。     

认知无线电网络中基于强化学习的智能信道选择算法

认知无线电系统不仅要具有自适应性,更应具备一定的智能性。该文将强化学习理论引入到认知无线电系统中,用于解决次用户在频谱感知过程中的信道选择问题,提出了一种基于强化学习的信道选择算法。该算法在未知主用户占用规律和动态特性的前提下,仅通过不断与环境进行交互学习,便能够引导次用户选择“较好”信道优先进行感知,使次用户吞吐量得到提高。仿真结果表明,相对于现有信道选择算法,所提算法可有效提高次用户的吞吐量,并且在主用户使用规律发生变化时,能够自动实现二次收敛,可作为认知无线电系统迈向智能化的一种尝试。      

基于最优中继的自适应协作频谱感知算法

针对认知系统中感知信道存在衰落和中继能耗较大问题,提出一种兼顾感知性能和感知能耗的中继协作频谱感知算法。该算法通过机会中继协作、基于效益函数的最优中继协作和系统参数自适应调整机制,能够获得性能与能耗的优化折中。文章对所提算法进行了详细的理论推导和性能分析,并对非中继协作感知算法和最优中继固定的协作感知算法以及本算法在不同系统参数下的感知性能进行了仿真比较。结果表明本算法具有一定的优越性。     

长时延扩展水声信道的联合稀疏恢复估计

对具有长时延扩展的水声信道,传统的信道估计算法如最小二乘法将在大量零值抽头产生严重的估计噪声,导致估计性能下降,同时信道估计时所需的较高估计器阶数大大提高了运算复杂度。压缩感知信道估计方法可有效利用多径稀疏特性改善性能,但需采用较大的训练序列长度以保证稀疏恢复精度,由此导致额外的系统开销。利用水声信道多径稀疏结构在数据块间存在的相关性,建立基于分布式压缩感知的长时延水声信道联合稀疏模型,从而可利用同步正交匹配追踪算法进行联合重构,以进一步减小系统的训练序列开销,提高估计性能。最后通过仿真和海上实验验证了所提方法的有效性。     

一种多天线智能谱感知方法研究

频谱感知和多天线分集合并技术是目前无线通信研究的热点.为了在复杂的信道衰落环境下实施有效的检测,融合多种检测方法是目前频谱感知技术的发展趋势.提出了一种基于匹配滤波器检测、能量检测和循环平稳检测的多天线合并智能频谱感知算法.通过建立高斯信道下二元假设检验模型,得出了总检测概率的封闭表达式.各种条件下的检测概率和检测时间的接收机工作特性(Receiver Operating Characteristic,ROC)实验结果表明所提算法优于单天线的性能,有效地利用了分集技术并减小了信号瞬时波动,保证在衰落信道条件下也能得到较高的检测概率.这对发展新型频谱感知技术,促进认知无线电技术应用具有重要意义.     

基于簇的块稀疏压缩感知的60GHz信道估计

基于压缩感知设计适用于60 GHz毫米波通信系统的信道估计方案,深入研究了正交匹配追踪(OMP)算法和正则正交匹配追踪(Regularized OMP)算法的60 GHz信道估计性能;在此基础上,充分发掘60 GHz无线多径信道所呈现出的分簇特性,提出一种新颖的基于簇分级的稀疏压缩感知重构算法。新算法在有效减少重构迭代次数的前提下,亦能显著降低信道估计误差。综合对比分析了基于簇分块稀疏压缩感知重构算法和现有压缩感知算法在60 GHz信道估计应用中的重构性能,仿真结果表明,压缩感知算法可有效应用于60 GHz系统信道估计,而新设计的基于簇分级的稀疏压缩感知算法则在估计精度和实现复杂度方面具更优越性能。     

基于压缩感知信道能量观测的协作频谱感知算法

压缩感知为认知无线电宽带频谱感知提供了一种新思路。基于压缩感知原理,该文提出一种不需要重构宽带频谱本身,而是直接重构各信道能量的协作频谱感知方法。多个次用户使用宽带随机滤波器组获取信道能量的观测值。融合中心同步接收多个用户的能量观测,并利用同步稀疏自适应匹配追踪协作重构算法重构所有次用户的信道能量。仿真结果表明加性高斯白噪声环境下该协作感知方法所需的滤波器数目仅为传统方法的20%左右,瑞利衰落信道下也仅需传统方法的40%,有效降低了系统复杂度并改善感知性能。同时,该文提出的同步稀疏自适应匹配追踪算法对比经典的同步正交匹配追踪算法在重构精度及算法复杂度两方面都有所提升。     

Defense against primary user emulation attacks from the secondary user throughput perspective

The maximization of Secondary user (SU) throughput has been studied extensively in honest cooperative spectrum sensing (CSS). However, when primary user emulation attacks (PUEAs) are launched, the model of CSS changes. This also necessitates the redesigning of the SU throughput maximisation scheme. In this paper, such redesigning of the SU throughput maximisation scheme under PUEAs has been carried out. Our objective is to suppress the damages caused by the PUEAs on the SU throughput. To serve this purpose, an optimally weighted CSS has been proposed. The optimal weights are obtained by maximising the SU throughput while protecting the primary user (PU) from interference in a network facing the PUEAs. Considering the significance of simplicity and speed in CSS, we apply the Nelder Mead Simplex Algorithm to solve the problem. The experiments carried out endorse the effectiveness of the proposed scheme compared to the existing combination schemes.     

Clustering via dimensional reduction method for the projection pursuit based on the ICSA

The performance of the classical clustering algorithm is not always satisfied with the high-dimensional datasets, which make clustering method limited in many application. To solve this problem, clustering method with Projection Pursuit dimension reduction based on Immune Clonal Selection Algorithm (ICSA-PP) is proposed in this paper. Projection pursuit strategy can maintain consistent Euclidean distances between points in the low-dimensional embeddings where the ICSA is used to search optimizing projection direction. The proposed algorithm can converge quickly with less iteration to reduce dimension of some high-dimensional datasets, and in which space, K-mean clustering algorithm is used to partition the reduced data. The experiment results on UCI data show that the presented method can search quicker to optimize projection direction than Genetic Algorithm (GA) and it has better clustering results compared with traditional linear dimension reduction method for Principle Component Analysis (PCA).     

基于功率和倾角联合优化的小区中断补偿机制

为了实现对中断小区的自主补偿,该文基于自组织网络(SON)提出功率和倾角联合优化调整的小区中断补偿(COC)机制。首先以天线倾角和发射功率作为优化对象,然后对COC定义了合理的优化目标及评价指标,并对优化模型进行分析,最终给出基于遗传优化算法的补偿机制。在分时长期演进(TD-LTE)场景中进行仿真验证,该机制与参考文献中的3种算法相比,在覆盖、干扰和吞吐量等方面均有明显的改善。     

基于遗传的人工鱼群优化之武装直升机对地攻击火力分配决策

结合遗传算法和人工鱼群算法的优点对武装直升机对地攻击作战的火力分配问题进行研究,建立了火力分配的教学模型,并利用基于遗传算法的人工鱼群优化算法实现武装直升机对地攻击的火力分配.仿真实验结果表明,基于遗传算法的人工鱼群优化算法解决火力分配问题不仅收敛速度快、效果好,而且运行速度快、求解精度高,满足火力分配实时性和准确性的...     

主用户干扰约束下的机会频谱接入感知−传输时隙优化调度

提出一种基于主用户干扰约束的机会频谱接入感知-传输时隙调度优化方案。首先,推导切换机制下认知系统的吞吐量和主用户干扰率,建立感知时间和感知周期联合优化模型;然后,在主用户干扰率和次用户感知质量双重约束下,推导了可最大化认知系统吞吐量的最优感知时间和感知周期的闭合表达式;最后,阐述了时隙优化调度方案并计算了认知系统可获得的最大吞吐量。仿真结果表明,所提出的时隙调度方案可以为认知系统提供更高的吞吐量,并更好地适应主用户干扰率和感知质量约束的变化。     

Synthesis of satellite footprint patterns from rectangular planar array antenna by using swarm‐based optimization algorithms

A pattern synthesis method based on Firefly Algorithm (FA) and Artificial Bee Colony (ABC) optimization has been presented to generate satellite footprint patterns from a rectangular planar array of isotropic antennas by modifying the amplitude, phase, and the state of the array elements. Three cases comprising three different footprints of rectangular, square, and circular boundary are generated from the same array by using two different swarm‐based optimization algorithms FA and ABC. Both the algorithms, following the proposed procedures are able to generate the three different footprint patterns while maintaining a satisfactory lower peak side lobe level and ripple. A comparative analysis has been carried out between FA, ABC, and Genetic Algorithm (GA) for the presented problem in terms of fitness value for the three different cases. The superiority of FA and ABC over GA has been established in terms of finding better solutions for all the three cases of the proposed problem. Copyright © 2013 John Wiley & Sons, Ltd.     

FPGA PLACEMENT OPTIMIZATION BY TWO-STEP UNIFIED GENETIC ALGORITHM AND SIMULATED ANNEALING ALGORITHM

Genetic Algorithm （GA） is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it avoids converging to the local optimum. However, it takes too much CPU time in the late process of GA. On the other hand, in the late process Simulated Annealing （SA） converges faster than GA but it is easily trapped to local optimum. In this letter, a useful method that unifies GA and SA is introduced, which utilizes the advantage of the global search ability of GA and fast convergence of SA. The experimental results show that the proposed algorithm outperforms GA in terms of CPU time without degradation of performance. It also achieves highly comparable placement cost compared to the state-of-the-art results obtained by Versatile Place and Route （VPR） Tool.     

ALGA在岸基导弹航路规划中的应用研究

针对基本遗传算法(GA)易局部收敛的缺陷,设计了基于模式搜索的自学习算子,提出一种基于模式搜索的自学习遗传算法(ALGA)。通过仿真测试函数将ALGA与基本遗传算法、自适应遗传算法(AGA)进行比较,显示改进的ALGA提高了算法的综合搜索能力。将改进的ALGA运用到岸基导弹航路规划中,并进行仿真实验,仿真结果验证了改进算法的有效性。     

基于感知矩阵统计相关系数最小化的压缩感知雷达波形优化设计

为了改善压缩感知雷达(Compressive Sensing Radar, CSR)目标参数提取的性能,该文提出一种最小化感知矩阵统计相关系数的CSR波形优化设计方法。文中首先建立了通用的CSR系统模型,推导了最小化感知矩阵统计相关系数的波形优化目标函数,其次以多相编码信号作为优化码型并采用遗传算法对目标函数进行优化求解。优化设计的波形使得感知矩阵子矩阵近似正交程度达到最优,与传统波形相比,能够有效降低目标参数估计误差,提高可检测目标个数的上限,改善了CSR目标参数提取的准确性和鲁棒性。计算机仿真验证了该方法的有效性。     

Combining feature scaling estimation with SVM classifier design using GA approach

This letter adopts a GA （Genetic Algorithm） approach to assist in learning scaling of features that are most favorable to SVM （Support Vector Machines） classifier, which is named as GA-SVM. The relevant coefficients of various features to the classification task, measured by real-valued scaling, are estimated efficiently by using GA. And GA exploits heavy-bias operator to promote sparsity in the scaling of features. There are many potential benefits of this method： Feature selection is performed by eliminating irrelevant features whose scaling is zero, an SVM classifier that has enhanced generalization ability can be learned simultaneously. Experimental comparisons using original SVM and GA-SVM demonstrate both economical feature selection and excellent classification accuracy on junk e-mail recognition problem and Internet ad recognition problem. The experimental results show that comparing with original SVM classifier, the number of support vector decreases significantly and better classification results are achieved based on GA-SVM. It also demonstrates that GA can provide a simple, general, and powerful framework for tuning parameters in optimal problem, which directly improves the recognition performance and recognition rate of SVM.